Submission #486856

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
486856	2021-11-13T02:22:20 Z	TypeYippie	Art Exhibition (JOI18_art)	C++14	100 / 100	195 ms	28908 KB

art

#include <bits/stdc++.h>
using namespace std;

const int N = 5e5+5;
int n;
pair<long long, long long> art[N];
long long pref[N];

int main(){
	scanf("%d", &n);
	for(int i = 1; i <= n; i++){
		scanf("%lld%lld", &art[i].first, &art[i].second);
	}
	sort(art+1, art+n+1);
	pref[0] = 0;
	for(int i = 1; i <= n; i++){
		pref[i] = pref[i-1]+art[i].second;
	}
	priority_queue<long long> pq;
	long long ans = 0;
	for(int i = n; i > 0; i--){
		pq.push(pref[i]-art[i].first);
		ans = max(ans, (pq.top()-pref[i-1])+art[i].first);
	}
	printf("%lld\n", ans);

	return 0;
}

Compilation message

art.cpp: In function 'int main()':
art.cpp:10:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   10 |  scanf("%d", &n);
      |  ~~~~~^~~~~~~~~~
art.cpp:12:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   12 |   scanf("%lld%lld", &art[i].first, &art[i].second);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	296 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	0 ms	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct

Subtask #2

20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	296 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	0 ms	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	0 ms	332 KB	Output is correct
13	Correct	0 ms	204 KB	Output is correct
14	Correct	0 ms	332 KB	Output is correct
15	Correct	0 ms	332 KB	Output is correct
16	Correct	1 ms	304 KB	Output is correct
17	Correct	1 ms	332 KB	Output is correct
18	Correct	0 ms	300 KB	Output is correct
19	Correct	0 ms	204 KB	Output is correct
20	Correct	0 ms	332 KB	Output is correct
21	Correct	1 ms	332 KB	Output is correct
22	Correct	1 ms	332 KB	Output is correct
23	Correct	0 ms	332 KB	Output is correct
24	Correct	1 ms	332 KB	Output is correct
25	Correct	1 ms	332 KB	Output is correct
26	Correct	0 ms	332 KB	Output is correct

Subtask #3

20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	296 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	0 ms	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	0 ms	332 KB	Output is correct
13	Correct	0 ms	204 KB	Output is correct
14	Correct	0 ms	332 KB	Output is correct
15	Correct	0 ms	332 KB	Output is correct
16	Correct	1 ms	304 KB	Output is correct
17	Correct	1 ms	332 KB	Output is correct
18	Correct	0 ms	300 KB	Output is correct
19	Correct	0 ms	204 KB	Output is correct
20	Correct	0 ms	332 KB	Output is correct
21	Correct	1 ms	332 KB	Output is correct
22	Correct	1 ms	332 KB	Output is correct
23	Correct	0 ms	332 KB	Output is correct
24	Correct	1 ms	332 KB	Output is correct
25	Correct	1 ms	332 KB	Output is correct
26	Correct	0 ms	332 KB	Output is correct
27	Correct	2 ms	588 KB	Output is correct
28	Correct	2 ms	588 KB	Output is correct
29	Correct	2 ms	588 KB	Output is correct
30	Correct	2 ms	620 KB	Output is correct
31	Correct	2 ms	632 KB	Output is correct
32	Correct	2 ms	588 KB	Output is correct
33	Correct	2 ms	588 KB	Output is correct
34	Correct	3 ms	588 KB	Output is correct
35	Correct	2 ms	588 KB	Output is correct
36	Correct	2 ms	644 KB	Output is correct
37	Correct	2 ms	588 KB	Output is correct
38	Correct	2 ms	588 KB	Output is correct
39	Correct	2 ms	588 KB	Output is correct
40	Correct	2 ms	568 KB	Output is correct
41	Correct	2 ms	564 KB	Output is correct
42	Correct	2 ms	596 KB	Output is correct
43	Correct	2 ms	588 KB	Output is correct
44	Correct	2 ms	588 KB	Output is correct
45	Correct	3 ms	588 KB	Output is correct
46	Correct	2 ms	588 KB	Output is correct
47	Correct	3 ms	588 KB	Output is correct
48	Correct	2 ms	588 KB	Output is correct
49	Correct	2 ms	588 KB	Output is correct
50	Correct	2 ms	588 KB	Output is correct
51	Correct	2 ms	588 KB	Output is correct

Subtask #4

50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	296 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	0 ms	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	0 ms	332 KB	Output is correct
13	Correct	0 ms	204 KB	Output is correct
14	Correct	0 ms	332 KB	Output is correct
15	Correct	0 ms	332 KB	Output is correct
16	Correct	1 ms	304 KB	Output is correct
17	Correct	1 ms	332 KB	Output is correct
18	Correct	0 ms	300 KB	Output is correct
19	Correct	0 ms	204 KB	Output is correct
20	Correct	0 ms	332 KB	Output is correct
21	Correct	1 ms	332 KB	Output is correct
22	Correct	1 ms	332 KB	Output is correct
23	Correct	0 ms	332 KB	Output is correct
24	Correct	1 ms	332 KB	Output is correct
25	Correct	1 ms	332 KB	Output is correct
26	Correct	0 ms	332 KB	Output is correct
27	Correct	2 ms	588 KB	Output is correct
28	Correct	2 ms	588 KB	Output is correct
29	Correct	2 ms	588 KB	Output is correct
30	Correct	2 ms	620 KB	Output is correct
31	Correct	2 ms	632 KB	Output is correct
32	Correct	2 ms	588 KB	Output is correct
33	Correct	2 ms	588 KB	Output is correct
34	Correct	3 ms	588 KB	Output is correct
35	Correct	2 ms	588 KB	Output is correct
36	Correct	2 ms	644 KB	Output is correct
37	Correct	2 ms	588 KB	Output is correct
38	Correct	2 ms	588 KB	Output is correct
39	Correct	2 ms	588 KB	Output is correct
40	Correct	2 ms	568 KB	Output is correct
41	Correct	2 ms	564 KB	Output is correct
42	Correct	2 ms	596 KB	Output is correct
43	Correct	2 ms	588 KB	Output is correct
44	Correct	2 ms	588 KB	Output is correct
45	Correct	3 ms	588 KB	Output is correct
46	Correct	2 ms	588 KB	Output is correct
47	Correct	3 ms	588 KB	Output is correct
48	Correct	2 ms	588 KB	Output is correct
49	Correct	2 ms	588 KB	Output is correct
50	Correct	2 ms	588 KB	Output is correct
51	Correct	2 ms	588 KB	Output is correct
52	Correct	192 ms	28824 KB	Output is correct
53	Correct	195 ms	28812 KB	Output is correct
54	Correct	192 ms	28808 KB	Output is correct
55	Correct	183 ms	28872 KB	Output is correct
56	Correct	178 ms	28868 KB	Output is correct
57	Correct	185 ms	28840 KB	Output is correct
58	Correct	176 ms	28908 KB	Output is correct
59	Correct	178 ms	28848 KB	Output is correct
60	Correct	177 ms	28832 KB	Output is correct
61	Correct	179 ms	28676 KB	Output is correct
62	Correct	176 ms	28852 KB	Output is correct
63	Correct	177 ms	28800 KB	Output is correct
64	Correct	173 ms	28836 KB	Output is correct
65	Correct	183 ms	28900 KB	Output is correct
66	Correct	179 ms	28852 KB	Output is correct
67	Correct	178 ms	28808 KB	Output is correct
68	Correct	177 ms	28856 KB	Output is correct