oj.uz

답안 #630612

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
630612 2022-08-16T16:12:32 Z kyaruru 학교 설립 (IZhO13_school) Java 11
25 / 100
 2000 ms 51488 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;
        while(i<p+q){
            while(use[aa.peek()[2]]) aa.poll();
            while(use[bb.peek()[2]]) bb.poll();
            int[] r;
            if(tq==0 || aa.peek()[0]>bb.peek()[1]) {
                r = aa.poll();
                ka[i][0]=r[0];
                ka[i][1]=r[1];
                use[r[2]]=true;
                tp--;
            }
            else if(tp==0 || aa.peek()[0]<=bb.peek()[1]){
                r = bb.poll();
                ka[i][0]=r[0];
                ka[i][1]=r[1];
                use[r[2]]=true;
                tq--;
            }
            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
25.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 69 ms 8868 KB Output is correct
2 Correct 71 ms 8900 KB Output is correct
3 Correct 71 ms 8976 KB Output is correct
4 Incorrect 79 ms 8876 KB Output isn't correct
5 Incorrect 71 ms 8824 KB Output isn't correct
6 Incorrect 83 ms 8872 KB Output isn't correct
7 Incorrect 271 ms 14340 KB Output isn't correct
8 Correct 507 ms 14968 KB Output is correct
9 Incorrect 406 ms 14968 KB Output isn't correct
10 Incorrect 439 ms 14980 KB Output isn't correct
11 Incorrect 532 ms 15400 KB Output isn't correct
12 Incorrect 498 ms 15076 KB Output isn't correct
13 Incorrect 1379 ms 26436 KB Output isn't correct
14 Incorrect 1051 ms 24600 KB Output isn't correct
15 Incorrect 896 ms 30788 KB Output isn't correct
16 Correct 1476 ms 35876 KB Output is correct
17 Execution timed out 2074 ms 40788 KB Time limit exceeded
18 Incorrect 1830 ms 44800 KB Output isn't correct
19 Execution timed out 2080 ms 49696 KB Time limit exceeded
20 Execution timed out 2058 ms 51488 KB Time limit exceeded