oj.uz

Submission #630624

# Submission time Handle Problem Language Result Execution time Memory
630624 2022-08-16T16:48:45 Z kyaruru Schools (IZhO13_school) Java 11
30 / 100
 2000 ms 51464 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) -> o2[0]-o1[0]);
        PriorityQueue<int[]> bb=new PriorityQueue<>((o1, o2) -> o2[1]-o1[1]);
        String[] s=bf.readLine().split(" ");
        int a=Integer.parseInt(s[0]),p=Integer.parseInt(s[1]),q=Integer.parseInt(s[2]);
        boolean[] use=new boolean[a];
        for(int i=0; i<a; i++){
            s=bf.readLine().split(" ");
            int x=Integer.parseInt(s[0]),y=Integer.parseInt(s[1]);
            aa.add(new int[]{x,y,i});
            bb.add(new int[]{x,y,i});
        }
        int[][] ka=new int[p+q][2];
        int i=0,tp=p,tq=q,re=0;
        while(tp-->0){
            int[] r=aa.poll();
            ka[i][0]=r[0];
            ka[i][1]=r[1];
            use[r[2]]=true;
            i++;
        }
        while(tq-->0){
            int[] r=bb.poll();
            if(use[r[2]]) re++;
            else{
                ka[i][0]=r[0];
                ka[i][1]=r[1];
                use[r[2]]=true;
                i++;
            }
        }
        while(re-->0){
            while(use[aa.peek()[2]]) aa.poll();
            while(use[bb.peek()[2]]) bb.poll();
            int[] r;
            if(aa.peek()[0]>bb.peek()[1]) r=aa.poll();
            else r=bb.poll();
            ka[i][0]=r[0];
            ka[i][1]=r[1];
            use[r[2]]=true;
            i++;
        }
        Arrays.sort(ka,(o1, o2) -> (o2[0]-o2[1])-(o1[0]-o1[1]));
        i=0;
        long sum=0;
        for(; i<p; i++) sum+=ka[i][0];
        for(; i<p+q; i++) sum+=ka[i][1];
        System.out.println(sum);
    }
}

Subtask #1
30.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 92 ms 8972 KB Output is correct
2 Correct 75 ms 8912 KB Output is correct
3 Correct 79 ms 9172 KB Output is correct
4 Incorrect 76 ms 8972 KB Output isn't correct
5 Incorrect 70 ms 9068 KB Output isn't correct
6 Incorrect 76 ms 9080 KB Output isn't correct
7 Incorrect 279 ms 14472 KB Output isn't correct
8 Correct 495 ms 15168 KB Output is correct
9 Incorrect 373 ms 14900 KB Output isn't correct
10 Incorrect 354 ms 15084 KB Output isn't correct
11 Incorrect 484 ms 15144 KB Output isn't correct
12 Incorrect 425 ms 15068 KB Output isn't correct
13 Incorrect 1302 ms 19828 KB Output isn't correct
14 Incorrect 1286 ms 24804 KB Output isn't correct
15 Correct 842 ms 30636 KB Output is correct
16 Correct 1746 ms 36296 KB Output is correct
17 Execution timed out 2076 ms 40864 KB Time limit exceeded
18 Incorrect 1971 ms 44644 KB Output isn't correct
19 Execution timed out 2021 ms 48980 KB Time limit exceeded
20 Execution timed out 2071 ms 51464 KB Time limit exceeded