Submission #110472

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
110472	2019-05-10T21:34:55 Z	sams	Exhibition (JOI19_ho_t2)	C++14	100 / 100	106 ms	1656 KB

joi2019_ho_t2

#include <bits/stdc++.h>

using namespace std;

const int maxn = 1e5+10;

struct pic{
	int s, v;
} in[maxn];

bool comp(pic a, pic b)
{
	if(a.v != b.v) return a.v < b.v;
	return a.s < b.s;
}
int n, m;
int mol[maxn];

int main()
{
	scanf("%d%d", &n, &m);

	for(int i = 1 ; i <= n ; ++i) scanf("%d%d", &in[i].s, &in[i].v);
	for(int i = 1 ; i <= m ; ++i) scanf("%d", &mol[i]);
	
	sort(in + 1, in+n+1, comp);
	sort(mol+1, mol+m+1);
	
	int ans = 0, pos = n;

	for(int i = m ; i >= 1; --i)
	{
		for(; pos >= 1 && in[pos].s > mol[i]; pos--);

		if(pos >= 1)
		{
			ans++;
			pos--;
		}
	}
	printf("%d\n", ans);
  	return 0;
}

Compilation message

joi2019_ho_t2.cpp: In function 'int main()':
joi2019_ho_t2.cpp:21:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &n, &m);
  ~~~~~^~~~~~~~~~~~~~~~
joi2019_ho_t2.cpp:23:37: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i = 1 ; i <= n ; ++i) scanf("%d%d", &in[i].s, &in[i].v);
                                ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
joi2019_ho_t2.cpp:24:37: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i = 1 ; i <= m ; ++i) scanf("%d", &mol[i]);
                                ~~~~~^~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
40.0 / 40.0

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

Subtask #3
50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	256 KB	Output is correct
2	Correct	2 ms	256 KB	Output is correct
3	Correct	2 ms	384 KB	Output is correct
4	Correct	3 ms	256 KB	Output is correct
5	Correct	2 ms	256 KB	Output is correct
6	Correct	2 ms	384 KB	Output is correct
7	Correct	2 ms	256 KB	Output is correct
8	Correct	2 ms	384 KB	Output is correct
9	Correct	2 ms	356 KB	Output is correct
10	Correct	2 ms	256 KB	Output is correct
11	Correct	2 ms	384 KB	Output is correct
12	Correct	2 ms	256 KB	Output is correct
13	Correct	2 ms	256 KB	Output is correct
14	Correct	3 ms	384 KB	Output is correct
15	Correct	2 ms	256 KB	Output is correct
16	Correct	2 ms	384 KB	Output is correct
17	Correct	2 ms	256 KB	Output is correct
18	Correct	2 ms	256 KB	Output is correct
19	Correct	2 ms	256 KB	Output is correct
20	Correct	2 ms	384 KB	Output is correct
21	Correct	2 ms	384 KB	Output is correct
22	Correct	3 ms	384 KB	Output is correct
23	Correct	2 ms	384 KB	Output is correct
24	Correct	3 ms	384 KB	Output is correct
25	Correct	2 ms	384 KB	Output is correct
26	Correct	5 ms	384 KB	Output is correct
27	Correct	3 ms	384 KB	Output is correct
28	Correct	3 ms	384 KB	Output is correct
29	Correct	2 ms	356 KB	Output is correct
30	Correct	3 ms	384 KB	Output is correct
31	Correct	3 ms	384 KB	Output is correct
32	Correct	3 ms	384 KB	Output is correct
33	Correct	3 ms	384 KB	Output is correct
34	Correct	3 ms	384 KB	Output is correct
35	Correct	3 ms	384 KB	Output is correct
36	Correct	3 ms	384 KB	Output is correct
37	Correct	3 ms	384 KB	Output is correct
38	Correct	67 ms	1528 KB	Output is correct
39	Correct	61 ms	1528 KB	Output is correct
40	Correct	57 ms	1528 KB	Output is correct
41	Correct	68 ms	1528 KB	Output is correct
42	Correct	78 ms	1528 KB	Output is correct
43	Correct	106 ms	1584 KB	Output is correct
44	Correct	83 ms	1612 KB	Output is correct
45	Correct	79 ms	1532 KB	Output is correct
46	Correct	73 ms	1448 KB	Output is correct
47	Correct	78 ms	1528 KB	Output is correct
48	Correct	66 ms	1528 KB	Output is correct
49	Correct	58 ms	1300 KB	Output is correct
50	Correct	56 ms	1528 KB	Output is correct
51	Correct	73 ms	1500 KB	Output is correct
52	Correct	90 ms	1528 KB	Output is correct
53	Correct	88 ms	1528 KB	Output is correct
54	Correct	90 ms	1528 KB	Output is correct
55	Correct	62 ms	1528 KB	Output is correct
56	Correct	45 ms	1152 KB	Output is correct
57	Correct	24 ms	800 KB	Output is correct
58	Correct	39 ms	1144 KB	Output is correct
59	Correct	42 ms	1144 KB	Output is correct
60	Correct	24 ms	768 KB	Output is correct
61	Correct	45 ms	1016 KB	Output is correct
62	Correct	89 ms	1528 KB	Output is correct
63	Correct	70 ms	1528 KB	Output is correct
64	Correct	82 ms	1656 KB	Output is correct
65	Correct	74 ms	1536 KB	Output is correct
66	Correct	72 ms	1656 KB	Output is correct
67	Correct	68 ms	1528 KB	Output is correct
68	Correct	84 ms	1532 KB	Output is correct
69	Correct	68 ms	1528 KB	Output is correct
70	Correct	74 ms	1528 KB	Output is correct
71	Correct	63 ms	1528 KB	Output is correct
72	Correct	76 ms	1528 KB	Output is correct
73	Correct	89 ms	1656 KB	Output is correct

Submission #110472

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