import java.util.ArrayList;
import java.util.Collections;
import java.util.Scanner;
import java.util.Arrays;
import java.util.Comparator;
class Pair {
int x;
int y;
// Constructor
public Pair(int x, int y) {
this.x = x;
this.y = y;
}
}
class ArrayOfPairsSorter {
static void sort(Pair[] arr) {
Comparator<Pair> comparator = new Comparator<>() {
@Override
public int compare(Pair p1, Pair p2) {
return p1.y - p2.y;
}
};
Arrays.sort(arr, comparator);
}
}
class joi2019_ho_t2 {
public static void main(String[] args){
Scanner scanner = new Scanner(System.in);
int N = scanner.nextInt();
int M = scanner.nextInt();
Pair[] pictures = new Pair[N];
ArrayList<Integer> frame = new ArrayList<Integer>(M);
for (int i=0; i<N; i++) {
pictures[i] = new Pair(scanner.nextInt(), scanner.nextInt());
}
for (int i=0; i<M; i++) {
frame.add(scanner.nextInt());
}
ArrayOfPairsSorter.sort(pictures);
Collections.sort(frame);
int paintingCounter = N;
int frameCounter = M-1;
for (int i=N-1; i>=0; i--) {
if (frameCounter >= 0) {
if (pictures[i].x <= frame.get(frameCounter)) {
frameCounter -= 1;
}
}
}
System.out.println(M - 1 - frameCounter);
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
98 ms |
10336 KB |
Output is correct |
2 |
Correct |
104 ms |
10184 KB |
Output is correct |
3 |
Incorrect |
107 ms |
10420 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
98 ms |
10336 KB |
Output is correct |
2 |
Correct |
104 ms |
10184 KB |
Output is correct |
3 |
Incorrect |
107 ms |
10420 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
98 ms |
10336 KB |
Output is correct |
2 |
Correct |
104 ms |
10184 KB |
Output is correct |
3 |
Incorrect |
107 ms |
10420 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |