1 import java.util.Scanner;
2
3 public class befozes {
4 private static int[] UVEGEK = {
5 5, 2, 2, 4, 3, 2, 4, 10, 5, 5, 3, 5, 4, 3, 3
6 };
7
8 public static void main(String[] args) {
9
10 System.out.println("2. feladat");
11 System.out.print("Mari neni lekvarja (dl): ");
12 Scanner scanner = new Scanner(System.in);
13 int L = scanner.nextInt();
14
15 System.out.println("3. feladat");
16 int maximum = 0;
17 for (int i = 1; i < UVEGEK.length; i++) {
18 if( UVEGEK[i] > UVEGEK[maximum]) {
19 maximum = i;
20 }
21 }
22 System.out.printf("A legnagyobb uveg: %d dl es %d. a sorban.%n", UVEGEK[maximum], maximum + 1);
23
24 System.out.println("4. feladat");
25 if (osszegzes(UVEGEK) >= L) {
26 System.out.println("Elegendo uveg volt.");
27 }
28 else {
29 System.out.println("Maradt lekvar.");
30 }
31 }
32
33 static int osszegzes(int[] tomb) {
34 int osszeg = 0;
35 for (int elem : tomb) {
36 osszeg += elem;
37 }
38 return osszeg;
39 }
40 }
41