답안 #316328

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
316328 2020-10-25T21:33:54 Z aZvezda Exhibition (JOI19_ho_t2) C++14
100 / 100
58 ms 4572 KB
#include <bits/stdc++.h>
using namespace std;
//#pragma GCC optimize ("O3")
//#pragma GCC target ("sse4")
#define endl "\n"
typedef long long ll;
template<class T, class T2> inline ostream &operator <<(ostream &out, const pair<T, T2> &x) { out << x.first << " " << x.second; return out;}
template<class T, class T2> inline istream &operator >>(istream &in, pair<T, T2> &x) { in >> x.first >> x.second; return in;}
template<class T, class T2> inline bool chkmax(T &x, const T2 &y) { return x < y ? x = y, 1 : 0; }
template<class T, class T2> inline bool chkmin(T &x, const T2 &y) { return x > y ? x = y, 1 : 0; }
const ll mod = 1e9 + 7;
#define out(x) "{" << (#x) << ": " << x << "} "

const ll MAX_N = 1e5 + 10;
pair<int, int> pict[MAX_N];
int sze[MAX_N];
int n, m;

signed main() {
	ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
	cin >> n >> m;
	for(int i = 0; i < n; i ++) {
		cin >> pict[i];
		swap(pict[i].first, pict[i].second);
	}
	for(int i = 0; i < m; i ++) {
		cin >> sze[i];
	}
	sort(pict, pict + n);
	reverse(pict, pict + n);
	sort(sze, sze + m);
	reverse(sze, sze + m);
	int ret = 0;
	for(int i = 0; i < n && ret < m; i ++) {
		if(pict[i].second <= sze[ret]) {
			ret ++;
		}
	}
	cout << ret << endl;
	return 0;
}

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 0 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 0 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 416 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 1 ms 404 KB Output is correct
34 Correct 1 ms 412 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 1 ms 384 KB Output is correct
37 Correct 1 ms 384 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 0 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 416 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 1 ms 404 KB Output is correct
34 Correct 1 ms 412 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 1 ms 384 KB Output is correct
37 Correct 1 ms 384 KB Output is correct
38 Correct 52 ms 4472 KB Output is correct
39 Correct 50 ms 4572 KB Output is correct
40 Correct 49 ms 4472 KB Output is correct
41 Correct 53 ms 4472 KB Output is correct
42 Correct 55 ms 4472 KB Output is correct
43 Correct 53 ms 4388 KB Output is correct
44 Correct 53 ms 4472 KB Output is correct
45 Correct 55 ms 4472 KB Output is correct
46 Correct 51 ms 4352 KB Output is correct
47 Correct 47 ms 3996 KB Output is correct
48 Correct 46 ms 3960 KB Output is correct
49 Correct 43 ms 3580 KB Output is correct
50 Correct 42 ms 3712 KB Output is correct
51 Correct 52 ms 4472 KB Output is correct
52 Correct 52 ms 4472 KB Output is correct
53 Correct 52 ms 4344 KB Output is correct
54 Correct 46 ms 4472 KB Output is correct
55 Correct 53 ms 4472 KB Output is correct
56 Correct 33 ms 3064 KB Output is correct
57 Correct 20 ms 1664 KB Output is correct
58 Correct 33 ms 3064 KB Output is correct
59 Correct 33 ms 3064 KB Output is correct
60 Correct 20 ms 1664 KB Output is correct
61 Correct 34 ms 2688 KB Output is correct
62 Correct 53 ms 4472 KB Output is correct
63 Correct 52 ms 4472 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 54 ms 4472 KB Output is correct
68 Correct 53 ms 4472 KB Output is correct
69 Correct 58 ms 4388 KB Output is correct
70 Correct 55 ms 4476 KB Output is correct
71 Correct 51 ms 4472 KB Output is correct
72 Correct 55 ms 4472 KB Output is correct
73 Correct 50 ms 4472 KB Output is correct