답안 #291531

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
291531 2020-09-05T13:06:10 Z reymontada61 Exhibition (JOI19_ho_t2) C++14
100 / 100
281 ms 4732 KB
#include <bits/stdc++.h>
using namespace std;

const int MXN = 100005;

int n, m;
priority_queue<pair<int, int>> p;
int f[MXN];

signed main() {

	cin >> n >> m;
	for (int i=0; i<n; i++) {
		int s, v;
		cin >> s >> v;
		p.push({v, s});
	}
	
	for (int i=0; i<m; i++) {
		cin >> f[i];
	}
	sort(f, f+m);
	
	int ans = 0;
	
	for (int i=m-1; i>=0; i--) {
		
		while (!p.empty() && p.top().second > f[i]) {
			p.pop();
		}
		
		if (p.empty()) continue;
		
		p.pop();
		ans++;
		
	}
	
	cout << ans << endl;

}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 0 ms 256 KB Output is correct
17 Correct 0 ms 256 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 0 ms 256 KB Output is correct
17 Correct 0 ms 256 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 3 ms 384 KB Output is correct
21 Correct 3 ms 384 KB Output is correct
22 Correct 4 ms 384 KB Output is correct
23 Correct 3 ms 384 KB Output is correct
24 Correct 3 ms 384 KB Output is correct
25 Correct 3 ms 384 KB Output is correct
26 Correct 3 ms 384 KB Output is correct
27 Correct 3 ms 384 KB Output is correct
28 Correct 3 ms 384 KB Output is correct
29 Correct 3 ms 384 KB Output is correct
30 Correct 3 ms 384 KB Output is correct
31 Correct 3 ms 384 KB Output is correct
32 Correct 2 ms 384 KB Output is correct
33 Correct 1 ms 256 KB Output is correct
34 Correct 2 ms 384 KB Output is correct
35 Correct 1 ms 256 KB Output is correct
36 Correct 3 ms 384 KB Output is correct
37 Correct 3 ms 384 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 0 ms 256 KB Output is correct
17 Correct 0 ms 256 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 3 ms 384 KB Output is correct
21 Correct 3 ms 384 KB Output is correct
22 Correct 4 ms 384 KB Output is correct
23 Correct 3 ms 384 KB Output is correct
24 Correct 3 ms 384 KB Output is correct
25 Correct 3 ms 384 KB Output is correct
26 Correct 3 ms 384 KB Output is correct
27 Correct 3 ms 384 KB Output is correct
28 Correct 3 ms 384 KB Output is correct
29 Correct 3 ms 384 KB Output is correct
30 Correct 3 ms 384 KB Output is correct
31 Correct 3 ms 384 KB Output is correct
32 Correct 2 ms 384 KB Output is correct
33 Correct 1 ms 256 KB Output is correct
34 Correct 2 ms 384 KB Output is correct
35 Correct 1 ms 256 KB Output is correct
36 Correct 3 ms 384 KB Output is correct
37 Correct 3 ms 384 KB Output is correct
38 Correct 275 ms 2444 KB Output is correct
39 Correct 271 ms 4588 KB Output is correct
40 Correct 270 ms 4712 KB Output is correct
41 Correct 278 ms 4600 KB Output is correct
42 Correct 276 ms 4588 KB Output is correct
43 Correct 275 ms 4584 KB Output is correct
44 Correct 276 ms 4712 KB Output is correct
45 Correct 273 ms 4460 KB Output is correct
46 Correct 274 ms 4660 KB Output is correct
47 Correct 248 ms 4076 KB Output is correct
48 Correct 244 ms 4072 KB Output is correct
49 Correct 217 ms 3816 KB Output is correct
50 Correct 219 ms 3688 KB Output is correct
51 Correct 275 ms 4588 KB Output is correct
52 Correct 273 ms 4584 KB Output is correct
53 Correct 273 ms 4584 KB Output is correct
54 Correct 271 ms 4584 KB Output is correct
55 Correct 279 ms 4732 KB Output is correct
56 Correct 169 ms 3180 KB Output is correct
57 Correct 91 ms 1656 KB Output is correct
58 Correct 171 ms 3128 KB Output is correct
59 Correct 171 ms 3180 KB Output is correct
60 Correct 94 ms 1656 KB Output is correct
61 Correct 154 ms 2800 KB Output is correct
62 Correct 272 ms 4588 KB Output is correct
63 Correct 272 ms 4588 KB Output is correct
64 Correct 274 ms 4628 KB Output is correct
65 Correct 274 ms 4588 KB Output is correct
66 Correct 277 ms 4588 KB Output is correct
67 Correct 272 ms 4536 KB Output is correct
68 Correct 277 ms 4660 KB Output is correct
69 Correct 273 ms 4584 KB Output is correct
70 Correct 272 ms 4584 KB Output is correct
71 Correct 277 ms 4588 KB Output is correct
72 Correct 281 ms 4716 KB Output is correct
73 Correct 271 ms 4588 KB Output is correct