답안 #110406

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
110406 2019-05-10T19:22:20 Z thiago4532 Exhibition (JOI19_ho_t2) C++17
100 / 100
206 ms 2812 KB
#include <bits/stdc++.h>
#define int int64_t
#define ff first
#define ss second

using namespace std;
const int maxn = 1e5 + 10;
pair<int, int> a[maxn];
int b[maxn];

int32_t main() {
	int n, m;
	cin >> n >> m;
	for(int i=1;i<=n;i++)
		cin >> a[i].ss >> a[i].ff;
	for(int i=1;i<=m;i++)
		cin >> b[i];
	sort(a+1, a+n+1);
	sort(b+1, b+m+1, greater<int>());

	int guy = n, ans=0;
	for(int i=1;i<=m;i++){
		while(guy >= 1 && a[guy].ss > b[i]) guy--;
		if(guy < 1) break;

		ans++;
		guy--;
	}
	cout << ans << "\n";
	return 0;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 3 ms 384 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 5 ms 256 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 11 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 380 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 3 ms 256 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 2 ms 256 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 3 ms 384 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 5 ms 256 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 11 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 380 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 3 ms 256 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 2 ms 256 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 3 ms 384 KB Output is correct
21 Correct 5 ms 384 KB Output is correct
22 Correct 3 ms 384 KB Output is correct
23 Correct 4 ms 384 KB Output is correct
24 Correct 4 ms 384 KB Output is correct
25 Correct 3 ms 412 KB Output is correct
26 Correct 4 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 4 ms 384 KB Output is correct
31 Correct 4 ms 384 KB Output is correct
32 Correct 3 ms 384 KB Output is correct
33 Correct 2 ms 384 KB Output is correct
34 Correct 3 ms 384 KB Output is correct
35 Correct 2 ms 384 KB Output is correct
36 Correct 5 ms 384 KB Output is correct
37 Correct 5 ms 384 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 3 ms 384 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 5 ms 256 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 11 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 380 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 3 ms 256 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 2 ms 256 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 3 ms 384 KB Output is correct
21 Correct 5 ms 384 KB Output is correct
22 Correct 3 ms 384 KB Output is correct
23 Correct 4 ms 384 KB Output is correct
24 Correct 4 ms 384 KB Output is correct
25 Correct 3 ms 412 KB Output is correct
26 Correct 4 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 4 ms 384 KB Output is correct
31 Correct 4 ms 384 KB Output is correct
32 Correct 3 ms 384 KB Output is correct
33 Correct 2 ms 384 KB Output is correct
34 Correct 3 ms 384 KB Output is correct
35 Correct 2 ms 384 KB Output is correct
36 Correct 5 ms 384 KB Output is correct
37 Correct 5 ms 384 KB Output is correct
38 Correct 195 ms 2640 KB Output is correct
39 Correct 162 ms 2616 KB Output is correct
40 Correct 145 ms 2600 KB Output is correct
41 Correct 140 ms 2796 KB Output is correct
42 Correct 151 ms 2680 KB Output is correct
43 Correct 135 ms 2808 KB Output is correct
44 Correct 143 ms 2632 KB Output is correct
45 Correct 137 ms 2804 KB Output is correct
46 Correct 178 ms 2804 KB Output is correct
47 Correct 131 ms 2460 KB Output is correct
48 Correct 129 ms 2424 KB Output is correct
49 Correct 120 ms 2296 KB Output is correct
50 Correct 124 ms 2240 KB Output is correct
51 Correct 151 ms 2684 KB Output is correct
52 Correct 187 ms 2680 KB Output is correct
53 Correct 162 ms 2652 KB Output is correct
54 Correct 141 ms 2716 KB Output is correct
55 Correct 156 ms 2604 KB Output is correct
56 Correct 99 ms 1912 KB Output is correct
57 Correct 55 ms 1192 KB Output is correct
58 Correct 110 ms 2040 KB Output is correct
59 Correct 101 ms 1912 KB Output is correct
60 Correct 56 ms 1144 KB Output is correct
61 Correct 87 ms 1656 KB Output is correct
62 Correct 138 ms 2680 KB Output is correct
63 Correct 139 ms 2812 KB Output is correct
64 Correct 138 ms 2680 KB Output is correct
65 Correct 135 ms 2604 KB Output is correct
66 Correct 136 ms 2680 KB Output is correct
67 Correct 144 ms 2656 KB Output is correct
68 Correct 139 ms 2712 KB Output is correct
69 Correct 147 ms 2620 KB Output is correct
70 Correct 146 ms 2680 KB Output is correct
71 Correct 206 ms 2808 KB Output is correct
72 Correct 146 ms 2680 KB Output is correct
73 Correct 143 ms 2680 KB Output is correct