답안 #336807

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
336807 2020-12-16T21:34:22 Z crackersamdjam Exhibition (JOI19_ho_t2) C++17
100 / 100
33 ms 1644 KB
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define gc getchar()
#define pc(x) putchar(x)
template<typename T> void scan(T &x){x = 0;bool _=0;T c=gc;_=c==45;c=_?gc:c;while(c<48||c>57)c=gc;for(;c<48||c>57;c=gc);for(;c>47&&c<58;c=gc)x=(x<<3)+(x<<1)+(c&15);x=_?-x:x;}
template<typename T> void printn(T n){bool _=0;_=n<0;n=_?-n:n;char snum[65];int i=0;do{snum[i++]=char(n%10+48);n/= 10;}while(n);--i;if (_)pc(45);while(i>=0)pc(snum[i--]);}
template<typename First, typename ... Ints> void scan(First &arg, Ints&... rest){scan(arg);scan(rest...);}
template<typename T> void print(T n){printn(n);pc(10);}
template<typename First, typename ... Ints> void print(First arg, Ints... rest){printn(arg);pc(32);print(rest...);}

using namespace std;
const int MM = 1e5+5;

int n, m, b[MM], ans;
pair<int, int> a[MM];

int main(){
	scan(n, m);
	for(int i = 0; i < n; i++)
		scan(a[i].second, a[i].first);
	sort(a, a+n);
	for(int i = 0; i < m; i++)
		scan(b[i]);
	sort(b, b+m);

	int r = m-1;
	for(int i = n-1; i >= 0; i--){
		if(r >= 0 and a[i].second <= b[r])
			r--;
	}

	print(m-1-r);
}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 0 ms 364 KB Output is correct
7 Correct 0 ms 364 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 0 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 0 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 0 ms 364 KB Output is correct
15 Correct 0 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 0 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 0 ms 364 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 0 ms 364 KB Output is correct
7 Correct 0 ms 364 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 0 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 0 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 0 ms 364 KB Output is correct
15 Correct 0 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 0 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 0 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 1 ms 364 KB Output is correct
37 Correct 1 ms 364 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 0 ms 364 KB Output is correct
7 Correct 0 ms 364 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 0 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 0 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 0 ms 364 KB Output is correct
15 Correct 0 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 0 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 0 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 1 ms 364 KB Output is correct
37 Correct 1 ms 364 KB Output is correct
38 Correct 30 ms 1516 KB Output is correct
39 Correct 28 ms 1516 KB Output is correct
40 Correct 24 ms 1516 KB Output is correct
41 Correct 31 ms 1516 KB Output is correct
42 Correct 30 ms 1516 KB Output is correct
43 Correct 32 ms 1516 KB Output is correct
44 Correct 32 ms 1516 KB Output is correct
45 Correct 31 ms 1644 KB Output is correct
46 Correct 29 ms 1516 KB Output is correct
47 Correct 27 ms 1388 KB Output is correct
48 Correct 26 ms 1388 KB Output is correct
49 Correct 25 ms 1260 KB Output is correct
50 Correct 24 ms 1260 KB Output is correct
51 Correct 31 ms 1544 KB Output is correct
52 Correct 30 ms 1516 KB Output is correct
53 Correct 31 ms 1516 KB Output is correct
54 Correct 24 ms 1516 KB Output is correct
55 Correct 31 ms 1516 KB Output is correct
56 Correct 18 ms 1132 KB Output is correct
57 Correct 13 ms 748 KB Output is correct
58 Correct 17 ms 1132 KB Output is correct
59 Correct 18 ms 1132 KB Output is correct
60 Correct 13 ms 748 KB Output is correct
61 Correct 20 ms 1004 KB Output is correct
62 Correct 31 ms 1516 KB Output is correct
63 Correct 31 ms 1516 KB Output is correct
64 Correct 31 ms 1516 KB Output is correct
65 Correct 31 ms 1516 KB Output is correct
66 Correct 31 ms 1516 KB Output is correct
67 Correct 32 ms 1516 KB Output is correct
68 Correct 31 ms 1516 KB Output is correct
69 Correct 32 ms 1516 KB Output is correct
70 Correct 33 ms 1516 KB Output is correct
71 Correct 30 ms 1516 KB Output is correct
72 Correct 32 ms 1516 KB Output is correct
73 Correct 29 ms 1516 KB Output is correct