답안 #156548

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
156548	2019-10-06T12:46:26 Z	Evirir	Exhibition (JOI19_ho_t2)	C++17	100 / 100	68 ms	5752 KB

joi2019_ho_t2

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

#define watch(x) cout<<(#x)<<"="<<(x)<<'\n'
#define mset(d,val) memset(d,val,sizeof(d))
#define setp(x) cout<<fixed<<setprecision(x)
#define forn(i,a,b) for(int i=a;i<b;i++)
#define fore(i,a,b) for(int i=a;i<=b;i++)
#define pb push_back
#define F first
#define S second
#define INF 2e14
#define MOD 998244353
#define pqueue priority_queue
#define fbo find_by_order
#define ook order_of_key
typedef long long ll;
typedef pair<ll,ll> ii;
typedef vector<ll> vi;
typedef vector<ii> vii;
typedef tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> pbds;

#define MAXN 100005

int n,m;
ii e[MAXN];
ll f[MAXN];

int main()
{
	ios_base::sync_with_stdio(0); cin.tie(0);
	
	cin>>n>>m;
	forn(i,0,n) cin>>e[i].S>>e[i].F;
	forn(i,0,m) cin>>f[i];
	
	sort(e,e+n,greater<ii>());
	sort(f,f+m,greater<ll>());
	
	int ptr=0,ans=0;
	forn(i,0,n){
		if(e[i].S<=f[ptr]){
			ans++;
			ptr++;
		}
		if(ptr==m) break;
	}
	
	cout<<ans<<'\n';
	
	return 0;
}

Subtask #1
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	248 KB	Output is correct
10	Correct	2 ms	376 KB	Output is correct
11	Correct	2 ms	376 KB	Output is correct
12	Correct	2 ms	380 KB	Output is correct
13	Correct	2 ms	376 KB	Output is correct
14	Correct	2 ms	376 KB	Output is correct
15	Correct	2 ms	376 KB	Output is correct
16	Correct	2 ms	376 KB	Output is correct
17	Correct	2 ms	376 KB	Output is correct
18	Correct	2 ms	376 KB	Output is correct
19	Correct	2 ms	376 KB	Output is correct

Subtask #2
40.0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	248 KB	Output is correct
10	Correct	2 ms	376 KB	Output is correct
11	Correct	2 ms	376 KB	Output is correct
12	Correct	2 ms	380 KB	Output is correct
13	Correct	2 ms	376 KB	Output is correct
14	Correct	2 ms	376 KB	Output is correct
15	Correct	2 ms	376 KB	Output is correct
16	Correct	2 ms	376 KB	Output is correct
17	Correct	2 ms	376 KB	Output is correct
18	Correct	2 ms	376 KB	Output is correct
19	Correct	2 ms	376 KB	Output is correct
20	Correct	2 ms	376 KB	Output is correct
21	Correct	3 ms	376 KB	Output is correct
22	Correct	2 ms	376 KB	Output is correct
23	Correct	2 ms	380 KB	Output is correct
24	Correct	3 ms	376 KB	Output is correct
25	Correct	3 ms	376 KB	Output is correct
26	Correct	3 ms	376 KB	Output is correct
27	Correct	3 ms	376 KB	Output is correct
28	Correct	3 ms	376 KB	Output is correct
29	Correct	3 ms	376 KB	Output is correct
30	Correct	3 ms	376 KB	Output is correct
31	Correct	3 ms	376 KB	Output is correct
32	Correct	2 ms	376 KB	Output is correct
33	Correct	2 ms	376 KB	Output is correct
34	Correct	3 ms	376 KB	Output is correct
35	Correct	2 ms	376 KB	Output is correct
36	Correct	3 ms	376 KB	Output is correct
37	Correct	3 ms	376 KB	Output is correct

Subtask #3
50.0 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	248 KB	Output is correct
10	Correct	2 ms	376 KB	Output is correct
11	Correct	2 ms	376 KB	Output is correct
12	Correct	2 ms	380 KB	Output is correct
13	Correct	2 ms	376 KB	Output is correct
14	Correct	2 ms	376 KB	Output is correct
15	Correct	2 ms	376 KB	Output is correct
16	Correct	2 ms	376 KB	Output is correct
17	Correct	2 ms	376 KB	Output is correct
18	Correct	2 ms	376 KB	Output is correct
19	Correct	2 ms	376 KB	Output is correct
20	Correct	2 ms	376 KB	Output is correct
21	Correct	3 ms	376 KB	Output is correct
22	Correct	2 ms	376 KB	Output is correct
23	Correct	2 ms	380 KB	Output is correct
24	Correct	3 ms	376 KB	Output is correct
25	Correct	3 ms	376 KB	Output is correct
26	Correct	3 ms	376 KB	Output is correct
27	Correct	3 ms	376 KB	Output is correct
28	Correct	3 ms	376 KB	Output is correct
29	Correct	3 ms	376 KB	Output is correct
30	Correct	3 ms	376 KB	Output is correct
31	Correct	3 ms	376 KB	Output is correct
32	Correct	2 ms	376 KB	Output is correct
33	Correct	2 ms	376 KB	Output is correct
34	Correct	3 ms	376 KB	Output is correct
35	Correct	2 ms	376 KB	Output is correct
36	Correct	3 ms	376 KB	Output is correct
37	Correct	3 ms	376 KB	Output is correct
38	Correct	64 ms	5596 KB	Output is correct
39	Correct	61 ms	5516 KB	Output is correct
40	Correct	57 ms	5628 KB	Output is correct
41	Correct	67 ms	5624 KB	Output is correct
42	Correct	64 ms	5624 KB	Output is correct
43	Correct	63 ms	5752 KB	Output is correct
44	Correct	64 ms	5596 KB	Output is correct
45	Correct	63 ms	5540 KB	Output is correct
46	Correct	62 ms	5496 KB	Output is correct
47	Correct	56 ms	4984 KB	Output is correct
48	Correct	56 ms	5116 KB	Output is correct
49	Correct	52 ms	4596 KB	Output is correct
50	Correct	51 ms	4444 KB	Output is correct
51	Correct	63 ms	5624 KB	Output is correct
52	Correct	68 ms	5624 KB	Output is correct
53	Correct	64 ms	5624 KB	Output is correct
54	Correct	57 ms	5648 KB	Output is correct
55	Correct	64 ms	5624 KB	Output is correct
56	Correct	40 ms	3784 KB	Output is correct
57	Correct	15 ms	2168 KB	Output is correct
58	Correct	40 ms	3832 KB	Output is correct
59	Correct	40 ms	3836 KB	Output is correct
60	Correct	25 ms	2168 KB	Output is correct
61	Correct	38 ms	3340 KB	Output is correct
62	Correct	64 ms	5624 KB	Output is correct
63	Correct	63 ms	5728 KB	Output is correct
64	Correct	63 ms	5624 KB	Output is correct
65	Correct	63 ms	5624 KB	Output is correct
66	Correct	63 ms	5624 KB	Output is correct
67	Correct	63 ms	5624 KB	Output is correct
68	Correct	63 ms	5664 KB	Output is correct
69	Correct	64 ms	5752 KB	Output is correct
70	Correct	65 ms	5624 KB	Output is correct
71	Correct	62 ms	5584 KB	Output is correct
72	Correct	65 ms	5532 KB	Output is correct
73	Correct	62 ms	5636 KB	Output is correct

답안 #156548

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