Submission #121058

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
121058	2019-06-26T04:23:20 Z	김세빈(#2968)	Exhibition (JOI19_ho_t2)	C++14	100 / 100	71 ms	1784 KB

joi2019_ho_t2

#include <bits/stdc++.h>

using namespace std;

typedef pair <int, int> pii;

priority_queue <pii> P;
int C[101010];
int n, m;

int main()
{
	int i, a, b;

	scanf("%d%d", &n, &m);

	for(i=0; i<n; i++){
		scanf("%d%d", &a, &b);
		P.push(pii(b, a));
	}

	for(i=0; i<m; i++){
		scanf("%d", C + i);
	}

	sort(C, C + m);
	reverse(C, C + m);

	for(i=0; i<m; i++){
		for(; !P.empty() && P.top().second > C[i]; P.pop());
		if(P.empty()) break; P.pop();
	}

	printf("%d\n", i);

	return 0;
}

Compilation message

joi2019_ho_t2.cpp: In function 'int main()':
joi2019_ho_t2.cpp:31:3: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   if(P.empty()) break; P.pop();
   ^~
joi2019_ho_t2.cpp:31:24: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   if(P.empty()) break; P.pop();
                        ^
joi2019_ho_t2.cpp:15: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:18:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d", &a, &b);
   ~~~~~^~~~~~~~~~~~~~~~
joi2019_ho_t2.cpp:23:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", C + i);
   ~~~~~^~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	384 KB	Output is correct
2	Correct	2 ms	256 KB	Output is correct
3	Correct	2 ms	384 KB	Output is correct
4	Correct	2 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	256 KB	Output is correct
9	Correct	2 ms	256 KB	Output is correct
10	Correct	2 ms	384 KB	Output is correct
11	Correct	2 ms	384 KB	Output is correct
12	Correct	2 ms	384 KB	Output is correct
13	Correct	2 ms	384 KB	Output is correct
14	Correct	2 ms	384 KB	Output is correct
15	Correct	2 ms	384 KB	Output is correct
16	Correct	2 ms	384 KB	Output is correct
17	Correct	2 ms	384 KB	Output is correct
18	Correct	2 ms	256 KB	Output is correct
19	Correct	2 ms	384 KB	Output is correct

Subtask #2
40.0 / 40.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	384 KB	Output is correct
2	Correct	2 ms	256 KB	Output is correct
3	Correct	2 ms	384 KB	Output is correct
4	Correct	2 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	256 KB	Output is correct
9	Correct	2 ms	256 KB	Output is correct
10	Correct	2 ms	384 KB	Output is correct
11	Correct	2 ms	384 KB	Output is correct
12	Correct	2 ms	384 KB	Output is correct
13	Correct	2 ms	384 KB	Output is correct
14	Correct	2 ms	384 KB	Output is correct
15	Correct	2 ms	384 KB	Output is correct
16	Correct	2 ms	384 KB	Output is correct
17	Correct	2 ms	384 KB	Output is correct
18	Correct	2 ms	256 KB	Output is correct
19	Correct	2 ms	384 KB	Output is correct
20	Correct	3 ms	384 KB	Output is correct
21	Correct	3 ms	384 KB	Output is correct
22	Correct	4 ms	384 KB	Output is correct
23	Correct	3 ms	384 KB	Output is correct
24	Correct	2 ms	384 KB	Output is correct
25	Correct	2 ms	384 KB	Output is correct
26	Correct	2 ms	384 KB	Output is correct
27	Correct	2 ms	384 KB	Output is correct
28	Correct	2 ms	384 KB	Output is correct
29	Correct	2 ms	384 KB	Output is correct
30	Correct	2 ms	384 KB	Output is correct
31	Correct	2 ms	384 KB	Output is correct
32	Correct	2 ms	256 KB	Output is correct
33	Correct	2 ms	256 KB	Output is correct
34	Correct	3 ms	384 KB	Output is correct
35	Correct	2 ms	384 KB	Output is correct
36	Correct	2 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	384 KB	Output is correct
2	Correct	2 ms	256 KB	Output is correct
3	Correct	2 ms	384 KB	Output is correct
4	Correct	2 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	256 KB	Output is correct
9	Correct	2 ms	256 KB	Output is correct
10	Correct	2 ms	384 KB	Output is correct
11	Correct	2 ms	384 KB	Output is correct
12	Correct	2 ms	384 KB	Output is correct
13	Correct	2 ms	384 KB	Output is correct
14	Correct	2 ms	384 KB	Output is correct
15	Correct	2 ms	384 KB	Output is correct
16	Correct	2 ms	384 KB	Output is correct
17	Correct	2 ms	384 KB	Output is correct
18	Correct	2 ms	256 KB	Output is correct
19	Correct	2 ms	384 KB	Output is correct
20	Correct	3 ms	384 KB	Output is correct
21	Correct	3 ms	384 KB	Output is correct
22	Correct	4 ms	384 KB	Output is correct
23	Correct	3 ms	384 KB	Output is correct
24	Correct	2 ms	384 KB	Output is correct
25	Correct	2 ms	384 KB	Output is correct
26	Correct	2 ms	384 KB	Output is correct
27	Correct	2 ms	384 KB	Output is correct
28	Correct	2 ms	384 KB	Output is correct
29	Correct	2 ms	384 KB	Output is correct
30	Correct	2 ms	384 KB	Output is correct
31	Correct	2 ms	384 KB	Output is correct
32	Correct	2 ms	256 KB	Output is correct
33	Correct	2 ms	256 KB	Output is correct
34	Correct	3 ms	384 KB	Output is correct
35	Correct	2 ms	384 KB	Output is correct
36	Correct	2 ms	384 KB	Output is correct
37	Correct	3 ms	384 KB	Output is correct
38	Correct	69 ms	1688 KB	Output is correct
39	Correct	68 ms	1644 KB	Output is correct
40	Correct	64 ms	1652 KB	Output is correct
41	Correct	68 ms	1784 KB	Output is correct
42	Correct	68 ms	1640 KB	Output is correct
43	Correct	67 ms	1640 KB	Output is correct
44	Correct	67 ms	1644 KB	Output is correct
45	Correct	69 ms	1640 KB	Output is correct
46	Correct	66 ms	1644 KB	Output is correct
47	Correct	61 ms	1520 KB	Output is correct
48	Correct	60 ms	1520 KB	Output is correct
49	Correct	55 ms	1520 KB	Output is correct
50	Correct	54 ms	1688 KB	Output is correct
51	Correct	68 ms	1640 KB	Output is correct
52	Correct	67 ms	1640 KB	Output is correct
53	Correct	68 ms	1640 KB	Output is correct
54	Correct	56 ms	1640 KB	Output is correct
55	Correct	66 ms	1644 KB	Output is correct
56	Correct	34 ms	1520 KB	Output is correct
57	Correct	25 ms	716 KB	Output is correct
58	Correct	34 ms	1528 KB	Output is correct
59	Correct	36 ms	1520 KB	Output is correct
60	Correct	24 ms	768 KB	Output is correct
61	Correct	39 ms	1136 KB	Output is correct
62	Correct	70 ms	1644 KB	Output is correct
63	Correct	70 ms	1668 KB	Output is correct
64	Correct	68 ms	1652 KB	Output is correct
65	Correct	68 ms	1644 KB	Output is correct
66	Correct	69 ms	1652 KB	Output is correct
67	Correct	68 ms	1644 KB	Output is correct
68	Correct	70 ms	1644 KB	Output is correct
69	Correct	69 ms	1644 KB	Output is correct
70	Correct	71 ms	1640 KB	Output is correct
71	Correct	67 ms	1640 KB	Output is correct
72	Correct	70 ms	1692 KB	Output is correct
73	Correct	65 ms	1644 KB	Output is correct

Submission #121058

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