oj.uz

Submission #630868

# Submission time Handle Problem Language Result Execution time Memory
630868 2022-08-17T09:32:05 Z kyaruru Schools (IZhO13_school) Java 11
30 / 100
 1845 ms 27668 KB 
import java.io.*;
import java.util.*;

public class school {
    public static void main(String[] args) throws IOException {
        BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
        PriorityQueue<int[]> aa=new PriorityQueue<>((o1, o2) -> o1[0]-o2[0]);
        PriorityQueue<int[]> bb=new PriorityQueue<>((o1, o2) -> o1[1]-o2[1]);
        String[] s=bf.readLine().split(" ");
        int a=Integer.parseInt(s[0]),p=Integer.parseInt(s[1]),q=Integer.parseInt(s[2]);
        int[][] k=new int[a][2];

        for(int i=0; i<a; i++){
            s=bf.readLine().split(" ");
            int x=Integer.parseInt(s[0]),y=Integer.parseInt(s[1]);
            k[i][0]=x; k[i][1]=y;
        }
        Arrays.sort(k,(o1, o2) -> (o2[0]-o2[1])-(o1[0]-o1[1]));
        int i=0;
        for(; i<p; i++) aa.add(k[i]);
        for(; i<p+q; i++) bb.add(k[i]);
        for(; i<a; i++){
            if(!bb.isEmpty()) {
                if (bb.peek()[1] < k[i][1]) {
                    int[] r = bb.poll();
                    if (!aa.isEmpty() && r[0] > aa.peek()[0]) {
                        aa.poll();
                        aa.add(r);
                    }
                    bb.add(k[i]);
                }
            }
            else if(!aa.isEmpty()){
                if(aa.peek()[0]<=k[i][0]){
                    aa.poll();
                    aa.add(k[i]);
                }
            }
        }
        long sum=0;
        while(!aa.isEmpty()) sum+=aa.poll()[0];
        while(!bb.isEmpty()) sum+=bb.poll()[1];
        System.out.println(sum);
    }
}

Subtask #1
30.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 67 ms 8936 KB Output is correct
2 Correct 67 ms 9008 KB Output is correct
3 Correct 69 ms 8912 KB Output is correct
4 Incorrect 73 ms 9032 KB Output isn't correct
5 Incorrect 71 ms 8852 KB Output isn't correct
6 Incorrect 76 ms 8948 KB Output isn't correct
7 Incorrect 487 ms 14944 KB Output isn't correct
8 Correct 483 ms 15184 KB Output is correct
9 Incorrect 443 ms 15084 KB Output isn't correct
10 Incorrect 453 ms 14904 KB Output isn't correct
11 Incorrect 494 ms 15012 KB Output isn't correct
12 Incorrect 540 ms 14876 KB Output isn't correct
13 Incorrect 1043 ms 17744 KB Output isn't correct
14 Incorrect 1215 ms 19264 KB Output isn't correct
15 Correct 1220 ms 21448 KB Output is correct
16 Correct 1308 ms 23816 KB Output is correct
17 Incorrect 1558 ms 25388 KB Output isn't correct
18 Incorrect 1698 ms 26244 KB Output isn't correct
19 Incorrect 1524 ms 26356 KB Output isn't correct
20 Incorrect 1845 ms 27668 KB Output isn't correct