-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathP579.java
54 lines (44 loc) · 1.24 KB
/
P579.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
package aceptaelreto;
import java.util.Scanner;
public class p579 {
static Scanner lector = new Scanner(System.in);
public static void main(String[] args) {
while(prova()){
}
}
static boolean prova(){
int casos = lector.nextInt();
int prio[] = new int[casos];
int durada[] = new int[casos];
if(casos == 0){
return false;
}
for (int i = 0; i < casos; i++) {
prio[i] = lector.nextInt();
durada[i]= lector.nextInt();
}
for (int i = 0; i < casos; i++) {
int index = getMax(prio, durada);
System.out.println(prio[index]+" "+durada[index]);
prio[index] = 0;
durada[index] = 0;
}
System.out.println("---");
return true;
}
static int getMax(int[] prio , int durada[]){
int maxValue = prio[0];
int index = 0;
for(int i=1;i<prio.length;i++){
if(prio[i] > maxValue){
maxValue = prio[i];
index = i;
}else if(prio[i] == maxValue){
if(durada[i] < durada[index]){
index = i;
}
}
}
return index;
}
}