Submission #306161

# Submission time Handle Problem Language Result Execution time Memory
306161 2020-09-24T17:58:58 Z sofapuden Exhibition (JOI19_ho_t2) C++14
100 / 100
270 ms 1784 KB
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;


int main(){
	ll n, m; cin >> n >> m;
	vector<int> x(m);
	vector<pair<int,int>> v(n);
	
	for(auto &i : v)cin >> i.second >> i.first;
	for(auto &i : x)cin >> i;
	
	sort(v.rbegin(),v.rend());
	sort(x.rbegin(),x.rend());
	
	int c = 0; int ans = 0;
	
	for(int i = 0; i < m; ++i){
		while(c != n && v[c].second > x[i])c++;
		if(c!=n){
			c++;
			ans++;
		}
	}
	cout << ans << "\n";
	
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 0 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 1 ms 256 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 0 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 0 ms 256 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 0 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 1 ms 256 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 0 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 0 ms 256 KB Output is correct
20 Correct 3 ms 384 KB Output is correct
21 Correct 3 ms 384 KB Output is correct
22 Correct 3 ms 384 KB Output is correct
23 Correct 3 ms 256 KB Output is correct
24 Correct 3 ms 256 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 256 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 256 KB Output is correct
32 Correct 2 ms 256 KB Output is correct
33 Correct 1 ms 256 KB Output is correct
34 Correct 2 ms 256 KB Output is correct
35 Correct 2 ms 256 KB Output is correct
36 Correct 3 ms 384 KB Output is correct
37 Correct 3 ms 384 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 0 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 1 ms 256 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 0 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 0 ms 256 KB Output is correct
20 Correct 3 ms 384 KB Output is correct
21 Correct 3 ms 384 KB Output is correct
22 Correct 3 ms 384 KB Output is correct
23 Correct 3 ms 256 KB Output is correct
24 Correct 3 ms 256 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 256 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 256 KB Output is correct
32 Correct 2 ms 256 KB Output is correct
33 Correct 1 ms 256 KB Output is correct
34 Correct 2 ms 256 KB Output is correct
35 Correct 2 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 268 ms 1536 KB Output is correct
39 Correct 264 ms 1656 KB Output is correct
40 Correct 263 ms 1536 KB Output is correct
41 Correct 269 ms 1536 KB Output is correct
42 Correct 267 ms 1552 KB Output is correct
43 Correct 267 ms 1536 KB Output is correct
44 Correct 264 ms 1656 KB Output is correct
45 Correct 265 ms 1536 KB Output is correct
46 Correct 263 ms 1536 KB Output is correct
47 Correct 237 ms 1408 KB Output is correct
48 Correct 239 ms 1408 KB Output is correct
49 Correct 213 ms 1400 KB Output is correct
50 Correct 210 ms 1280 KB Output is correct
51 Correct 269 ms 1536 KB Output is correct
52 Correct 267 ms 1656 KB Output is correct
53 Correct 260 ms 1656 KB Output is correct
54 Correct 259 ms 1656 KB Output is correct
55 Correct 264 ms 1536 KB Output is correct
56 Correct 175 ms 1292 KB Output is correct
57 Correct 92 ms 888 KB Output is correct
58 Correct 176 ms 1152 KB Output is correct
59 Correct 175 ms 1164 KB Output is correct
60 Correct 92 ms 888 KB Output is correct
61 Correct 153 ms 1144 KB Output is correct
62 Correct 264 ms 1536 KB Output is correct
63 Correct 265 ms 1656 KB Output is correct
64 Correct 265 ms 1656 KB Output is correct
65 Correct 266 ms 1656 KB Output is correct
66 Correct 266 ms 1536 KB Output is correct
67 Correct 266 ms 1536 KB Output is correct
68 Correct 266 ms 1656 KB Output is correct
69 Correct 268 ms 1656 KB Output is correct
70 Correct 266 ms 1784 KB Output is correct
71 Correct 266 ms 1656 KB Output is correct
72 Correct 270 ms 1656 KB Output is correct
73 Correct 262 ms 1536 KB Output is correct