Submission #786240

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
786240	2023-07-18T05:46:47 Z	KN200711	Exhibition (JOI19_ho_t2)	C++14	100 / 100	55 ms	1600 KB

joi2019_ho_t2

# include <bits/stdc++.h>
# define fi first
# define se second
using namespace std;

int main() {
	int N, M;
	scanf("%d %d", &N, &M);
	vector< pair<int, int> > S(N);
	for(int i=0;i<N;i++) {
		scanf("%d %d", &S[i].se, &S[i].fi);
	}
	vector<int> T(M);
	for(int i=0;i<M;i++) scanf("%d", &T[i]);
	sort(S.begin(), S.end());
	sort(T.begin(), T.end());
	
	int ans = 0, ls = M-1;
	for(int i=N-1;i>=0;i--) {
		if(ls >= 0 && S[i].se <= T[ls]) {
			ans++;
			ls--;
		}
	}
	printf("%d\n", ans);
}

Compilation message

joi2019_ho_t2.cpp: In function 'int main()':
joi2019_ho_t2.cpp:8:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    8 |  scanf("%d %d", &N, &M);
      |  ~~~~~^~~~~~~~~~~~~~~~~
joi2019_ho_t2.cpp:11:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 |   scanf("%d %d", &S[i].se, &S[i].fi);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
joi2019_ho_t2.cpp:14:28: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 |  for(int i=0;i<M;i++) scanf("%d", &T[i]);
      |                       ~~~~~^~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
40.0 / 40.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	1 ms	212 KB	Output is correct
23	Correct	1 ms	212 KB	Output is correct
24	Correct	1 ms	212 KB	Output is correct
25	Correct	1 ms	212 KB	Output is correct
26	Correct	1 ms	212 KB	Output is correct
27	Correct	1 ms	212 KB	Output is correct
28	Correct	1 ms	212 KB	Output is correct
29	Correct	1 ms	212 KB	Output is correct
30	Correct	1 ms	212 KB	Output is correct
31	Correct	1 ms	212 KB	Output is correct
32	Correct	1 ms	212 KB	Output is correct
33	Correct	1 ms	212 KB	Output is correct
34	Correct	1 ms	212 KB	Output is correct
35	Correct	1 ms	212 KB	Output is correct
36	Correct	1 ms	212 KB	Output is correct
37	Correct	1 ms	212 KB	Output is correct

Subtask #3
50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	1 ms	212 KB	Output is correct
23	Correct	1 ms	212 KB	Output is correct
24	Correct	1 ms	212 KB	Output is correct
25	Correct	1 ms	212 KB	Output is correct
26	Correct	1 ms	212 KB	Output is correct
27	Correct	1 ms	212 KB	Output is correct
28	Correct	1 ms	212 KB	Output is correct
29	Correct	1 ms	212 KB	Output is correct
30	Correct	1 ms	212 KB	Output is correct
31	Correct	1 ms	212 KB	Output is correct
32	Correct	1 ms	212 KB	Output is correct
33	Correct	1 ms	212 KB	Output is correct
34	Correct	1 ms	212 KB	Output is correct
35	Correct	1 ms	212 KB	Output is correct
36	Correct	1 ms	212 KB	Output is correct
37	Correct	1 ms	212 KB	Output is correct
38	Correct	51 ms	1600 KB	Output is correct
39	Correct	36 ms	1484 KB	Output is correct
40	Correct	39 ms	1484 KB	Output is correct
41	Correct	55 ms	1476 KB	Output is correct
42	Correct	38 ms	1484 KB	Output is correct
43	Correct	40 ms	1476 KB	Output is correct
44	Correct	42 ms	1364 KB	Output is correct
45	Correct	38 ms	1480 KB	Output is correct
46	Correct	37 ms	1364 KB	Output is correct
47	Correct	35 ms	1352 KB	Output is correct
48	Correct	34 ms	1352 KB	Output is correct
49	Correct	31 ms	1240 KB	Output is correct
50	Correct	30 ms	1248 KB	Output is correct
51	Correct	47 ms	1468 KB	Output is correct
52	Correct	38 ms	1472 KB	Output is correct
53	Correct	39 ms	1480 KB	Output is correct
54	Correct	33 ms	1492 KB	Output is correct
55	Correct	38 ms	1464 KB	Output is correct
56	Correct	24 ms	980 KB	Output is correct
57	Correct	14 ms	704 KB	Output is correct
58	Correct	24 ms	1072 KB	Output is correct
59	Correct	27 ms	1088 KB	Output is correct
60	Correct	14 ms	700 KB	Output is correct
61	Correct	24 ms	964 KB	Output is correct
62	Correct	39 ms	1480 KB	Output is correct
63	Correct	41 ms	1480 KB	Output is correct
64	Correct	41 ms	1472 KB	Output is correct
65	Correct	40 ms	1476 KB	Output is correct
66	Correct	38 ms	1480 KB	Output is correct
67	Correct	39 ms	1476 KB	Output is correct
68	Correct	38 ms	1484 KB	Output is correct
69	Correct	46 ms	1472 KB	Output is correct
70	Correct	40 ms	1476 KB	Output is correct
71	Correct	37 ms	1480 KB	Output is correct
72	Correct	40 ms	1480 KB	Output is correct
73	Correct	37 ms	1472 KB	Output is correct

Submission #786240

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