Submission #372622

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
372622	2021-03-01T07:14:36 Z	alishahali1382	Exhibition (JOI19_ho_t2)	C++14	100 / 100	64 ms	4972 KB

joi2019_ho_t2

#include <bits/stdc++.h>
#pragma GCC optimize ("O2,unroll-loops")
//#pragma GCC optimize("no-stack-protector,fast-math")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<ll, ll> pll;
#define debug(x) cerr<<#x<<'='<<(x)<<endl;
#define debugp(x) cerr<<#x<<"= {"<<(x.first)<<", "<<(x.second)<<"}"<<endl;
#define debug2(x, y) cerr<<"{"<<#x<<", "<<#y<<"} = {"<<(x)<<", "<<(y)<<"}"<<endl;
#define debugv(v) {cerr<<#v<<" : ";for (auto x:v) cerr<<x<<' ';cerr<<endl;}
#define all(x) x.begin(), x.end()
#define pb push_back
#define kill(x) return cout<<x<<'\n', 0;

const int inf=1000000010;
const ll INF=1000000000000001000LL;
const int mod=1000000007;
const int MAXN=300010, LOG=20;

int n, m, k, u, v, x, y, t, a, b, ans;
pii A[MAXN];
int S[MAXN], C[MAXN];

int main(){
	ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	//freopen("input.txt", "r", stdin);
	//freopen("output.txt", "w", stdout);
	cin>>n>>m;
	for (int i=1; i<=n; i++) cin>>A[i].second>>A[i].first;
	sort(A+1, A+n+1);
	for (int i=1; i<=n; i++) S[i]=A[i].second;
	for (int i=1; i<=m; i++) cin>>C[i];
	sort(C+1, C+m+1);
	int j=m;
	for (int i=n; i; i--) if (S[i]<=C[j]) j--, ans++;
	cout<<ans<<"\n";
	
	return 0;
}

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	492 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	384 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct
15	Correct	1 ms	384 KB	Output is correct
16	Correct	1 ms	364 KB	Output is correct
17	Correct	1 ms	364 KB	Output is correct
18	Correct	1 ms	364 KB	Output is correct
19	Correct	1 ms	364 KB	Output is correct

Subtask #2
40.0 / 40.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	492 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	384 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct
15	Correct	1 ms	384 KB	Output is correct
16	Correct	1 ms	364 KB	Output is correct
17	Correct	1 ms	364 KB	Output is correct
18	Correct	1 ms	364 KB	Output is correct
19	Correct	1 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	492 KB	Output is correct
24	Correct	1 ms	364 KB	Output is correct
25	Correct	1 ms	384 KB	Output is correct
26	Correct	1 ms	364 KB	Output is correct
27	Correct	1 ms	364 KB	Output is correct
28	Correct	2 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	384 KB	Output is correct
36	Correct	2 ms	364 KB	Output is correct
37	Correct	1 ms	364 KB	Output is correct

Subtask #3
50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	492 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	384 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct
15	Correct	1 ms	384 KB	Output is correct
16	Correct	1 ms	364 KB	Output is correct
17	Correct	1 ms	364 KB	Output is correct
18	Correct	1 ms	364 KB	Output is correct
19	Correct	1 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	492 KB	Output is correct
24	Correct	1 ms	364 KB	Output is correct
25	Correct	1 ms	384 KB	Output is correct
26	Correct	1 ms	364 KB	Output is correct
27	Correct	1 ms	364 KB	Output is correct
28	Correct	2 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	384 KB	Output is correct
36	Correct	2 ms	364 KB	Output is correct
37	Correct	1 ms	364 KB	Output is correct
38	Correct	52 ms	4844 KB	Output is correct
39	Correct	49 ms	4844 KB	Output is correct
40	Correct	49 ms	4844 KB	Output is correct
41	Correct	53 ms	4844 KB	Output is correct
42	Correct	64 ms	4844 KB	Output is correct
43	Correct	52 ms	4844 KB	Output is correct
44	Correct	52 ms	4844 KB	Output is correct
45	Correct	52 ms	4844 KB	Output is correct
46	Correct	50 ms	4844 KB	Output is correct
47	Correct	47 ms	4332 KB	Output is correct
48	Correct	55 ms	4332 KB	Output is correct
49	Correct	43 ms	3820 KB	Output is correct
50	Correct	42 ms	3820 KB	Output is correct
51	Correct	55 ms	4972 KB	Output is correct
52	Correct	52 ms	4844 KB	Output is correct
53	Correct	52 ms	4716 KB	Output is correct
54	Correct	45 ms	4844 KB	Output is correct
55	Correct	53 ms	4844 KB	Output is correct
56	Correct	32 ms	3436 KB	Output is correct
57	Correct	20 ms	1772 KB	Output is correct
58	Correct	32 ms	3436 KB	Output is correct
59	Correct	34 ms	3564 KB	Output is correct
60	Correct	20 ms	1772 KB	Output is correct
61	Correct	40 ms	2796 KB	Output is correct
62	Correct	56 ms	4844 KB	Output is correct
63	Correct	55 ms	4844 KB	Output is correct
64	Correct	52 ms	4844 KB	Output is correct
65	Correct	52 ms	4844 KB	Output is correct
66	Correct	52 ms	4972 KB	Output is correct
67	Correct	52 ms	4844 KB	Output is correct
68	Correct	52 ms	4844 KB	Output is correct
69	Correct	55 ms	4844 KB	Output is correct
70	Correct	55 ms	4844 KB	Output is correct
71	Correct	51 ms	4844 KB	Output is correct
72	Correct	55 ms	4884 KB	Output is correct
73	Correct	51 ms	4844 KB	Output is correct

Submission #372622

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 40.0 / 40.0

Subtask #3 50.0 / 50.0

Subtask #1
10.0 / 10.0

Subtask #2
40.0 / 40.0

Subtask #3
50.0 / 50.0