Submission #1255370

#	Time	Username	Problem	Language	Result	Execution time	Memory
1255370		vampirr	Exhibition (JOI19_ho_t2)	Java	100 / 100	728 ms	163248 KiB

joi2019_ho_t2

import java.util.*;
public class joi2019_ho_t2 {

	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int N = in.nextInt();
		int M = in.nextInt();
		int[][] pics = new int[N][2];
		for (int i=0; i<N; i++) {
			pics[i][0]=in.nextInt();
			pics[i][1]=in.nextInt();
		}
		int[] frames = new int[M];
		for (int i=0; i<M; i++) {
			frames[i]=in.nextInt();
		}
		in.close();
		
		Arrays.sort(pics, new Comparator<int[]>() {
            @Override
            public int compare(int[] a, int[] b) {
                if (a[1] != b[1]) {
                    return Integer.compare(a[1], b[1]); // sort by first column
                } else {
                    return Integer.compare(a[0], b[0]); // tie-break by second column
                }
            }
        });
		Arrays.sort(frames);
		
		
		int fpoint=M-1; int ppoint=N-1;
	
		for (; fpoint>=0; fpoint--) {
			
		    if (pics[ppoint][0] <= frames[fpoint]) {
		        ppoint--;
		    } else {
		        ppoint--;
		        fpoint++;
		    }
		    
		    if (ppoint<0) break;
		    
		}
		
		if (fpoint<0) {
			System.out.println(M);
		} else {
			System.out.println(M-fpoint);
		}
	}

}

• Subtask 1: 10 / 10
• Subtask 2: 40 / 40
• Subtask 3: 50 / 50