답안 #1039698

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1039698 2024-07-31T07:54:17 Z tamir1 Exhibition (JOI19_ho_t2) C++17
100 / 100
120 ms 4652 KB
#include<bits/stdc++.h>
#define ff first
#define ss second
using namespace std;
int n,m,c[100005],i,j,ans;
pair<int,int> p[100005];
bool cmp(pair<int,int> a,pair<int,int> b){
	if(a.ss==b.ss) return a.ff<b.ff;
	return a.ss<b.ss;
}
int main(){
	cin >> n >> m;
	for(i=1;i<=n;i++){
		cin >> p[i].ff >> p[i].ss;
	}
	for(i=1;i<=m;i++){
		cin >> c[i];
	}
	sort(p+1,p+n+1,cmp);
	sort(c+1,c+m+1);
	j=n;
	for(i=m;i>=1;i--){
		while(c[i]<p[j].ff) j--;
		if(j>0) ans++;
		else break;
		j--;
	}
	cout << ans;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 444 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 452 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 444 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 452 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 480 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 488 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 452 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 1 ms 484 KB Output is correct
37 Correct 2 ms 348 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 444 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 452 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 480 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 488 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 452 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 1 ms 484 KB Output is correct
37 Correct 2 ms 348 KB Output is correct
38 Correct 97 ms 4436 KB Output is correct
39 Correct 88 ms 4276 KB Output is correct
40 Correct 115 ms 4496 KB Output is correct
41 Correct 83 ms 4432 KB Output is correct
42 Correct 83 ms 4500 KB Output is correct
43 Correct 93 ms 4432 KB Output is correct
44 Correct 91 ms 4432 KB Output is correct
45 Correct 86 ms 4412 KB Output is correct
46 Correct 88 ms 4292 KB Output is correct
47 Correct 75 ms 3924 KB Output is correct
48 Correct 74 ms 3920 KB Output is correct
49 Correct 68 ms 3660 KB Output is correct
50 Correct 66 ms 3664 KB Output is correct
51 Correct 86 ms 4432 KB Output is correct
52 Correct 84 ms 4440 KB Output is correct
53 Correct 94 ms 4304 KB Output is correct
54 Correct 85 ms 4432 KB Output is correct
55 Correct 88 ms 4472 KB Output is correct
56 Correct 55 ms 2896 KB Output is correct
57 Correct 29 ms 1620 KB Output is correct
58 Correct 55 ms 2900 KB Output is correct
59 Correct 94 ms 3112 KB Output is correct
60 Correct 29 ms 1624 KB Output is correct
61 Correct 49 ms 2644 KB Output is correct
62 Correct 87 ms 4436 KB Output is correct
63 Correct 83 ms 4436 KB Output is correct
64 Correct 87 ms 4460 KB Output is correct
65 Correct 91 ms 4248 KB Output is correct
66 Correct 85 ms 4284 KB Output is correct
67 Correct 83 ms 4436 KB Output is correct
68 Correct 120 ms 4352 KB Output is correct
69 Correct 85 ms 4292 KB Output is correct
70 Correct 91 ms 4436 KB Output is correct
71 Correct 84 ms 4356 KB Output is correct
72 Correct 87 ms 4420 KB Output is correct
73 Correct 116 ms 4652 KB Output is correct