oj.uz

Submission #118866

# Submission time Handle Problem Language Result Execution time Memory
118866 2019-06-20T00:11:16 Z tmwilliamlin168 Exhibition (JOI19_ho_t2) C++14
100 / 100
 95 ms 4600 KB 
#include <bits/stdc++.h>
using namespace std;

const int mxN=1e5;
int n, m, b[mxN];
array<int, 2> a[mxN];

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);

	cin >> n >> m;
	for(int i=0; i<n; ++i)
		cin >> a[i][1] >> a[i][0];
	for(int i=0; i<m; ++i)
		cin >> b[i];
	sort(a, a+n);
	sort(b, b+m);
	int ans=m-1;
	for(int i=n-1; i>=0; --i)
		if(ans>=0&&a[i][1]<=b[ans])
			--ans;
	cout << m-1-ans;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 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 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 2 ms 384 KB Output is correct

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 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 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 2 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 2 ms 384 KB Output is correct
23 Correct 2 ms 384 KB Output is correct
24 Correct 2 ms 384 KB Output is correct
25 Correct 2 ms 384 KB Output is correct
26 Correct 2 ms 384 KB Output is correct
27 Correct 2 ms 384 KB Output is correct
28 Correct 2 ms 384 KB Output is correct
29 Correct 2 ms 384 KB Output is correct
30 Correct 2 ms 384 KB Output is correct
31 Correct 2 ms 384 KB Output is correct
32 Correct 2 ms 384 KB Output is correct
33 Correct 2 ms 384 KB Output is correct
34 Correct 2 ms 384 KB Output is correct
35 Correct 2 ms 384 KB Output is correct
36 Correct 3 ms 384 KB Output is correct
37 Correct 2 ms 384 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 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 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 2 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 2 ms 384 KB Output is correct
23 Correct 2 ms 384 KB Output is correct
24 Correct 2 ms 384 KB Output is correct
25 Correct 2 ms 384 KB Output is correct
26 Correct 2 ms 384 KB Output is correct
27 Correct 2 ms 384 KB Output is correct
28 Correct 2 ms 384 KB Output is correct
29 Correct 2 ms 384 KB Output is correct
30 Correct 2 ms 384 KB Output is correct
31 Correct 2 ms 384 KB Output is correct
32 Correct 2 ms 384 KB Output is correct
33 Correct 2 ms 384 KB Output is correct
34 Correct 2 ms 384 KB Output is correct
35 Correct 2 ms 384 KB Output is correct
36 Correct 3 ms 384 KB Output is correct
37 Correct 2 ms 384 KB Output is correct
38 Correct 50 ms 4472 KB Output is correct
39 Correct 50 ms 4344 KB Output is correct
40 Correct 46 ms 4472 KB Output is correct
41 Correct 52 ms 4476 KB Output is correct
42 Correct 52 ms 4472 KB Output is correct
43 Correct 52 ms 4412 KB Output is correct
44 Correct 53 ms 4368 KB Output is correct
45 Correct 51 ms 4472 KB Output is correct
46 Correct 52 ms 4344 KB Output is correct
47 Correct 95 ms 3960 KB Output is correct
48 Correct 48 ms 4068 KB Output is correct
49 Correct 42 ms 3576 KB Output is correct
50 Correct 44 ms 3576 KB Output is correct
51 Correct 60 ms 4472 KB Output is correct
52 Correct 79 ms 4472 KB Output is correct
53 Correct 53 ms 4344 KB Output is correct
54 Correct 47 ms 4572 KB Output is correct
55 Correct 54 ms 4480 KB Output is correct
56 Correct 36 ms 3064 KB Output is correct
57 Correct 20 ms 1664 KB Output is correct
58 Correct 36 ms 3064 KB Output is correct
59 Correct 34 ms 3072 KB Output is correct
60 Correct 20 ms 1792 KB Output is correct
61 Correct 32 ms 2652 KB Output is correct
62 Correct 54 ms 4472 KB Output is correct
63 Correct 53 ms 4520 KB Output is correct
64 Correct 53 ms 4472 KB Output is correct
65 Correct 52 ms 4472 KB Output is correct
66 Correct 53 ms 4472 KB Output is correct
67 Correct 52 ms 4472 KB Output is correct
68 Correct 51 ms 4408 KB Output is correct
69 Correct 53 ms 4600 KB Output is correct
70 Correct 53 ms 4376 KB Output is correct
71 Correct 50 ms 4472 KB Output is correct
72 Correct 53 ms 4480 KB Output is correct
73 Correct 50 ms 4472 KB Output is correct