Submission #41578

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
41578	2018-02-19T13:19:37 Z	szawinis	Art Exhibition (JOI18_art)	C++14	100 / 100	341 ms	16700 KB

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 5e5+1;

int n;
pair<ll, ll> vec[N];
priority_queue<ll, vector<ll>, greater<ll> > pq;
ll ans, sum[N];
int main() {
	scanf("%d", &n);
	for(int i = 1; i <= n; i++) {
		ll a, b;
		scanf("%lld %lld", &a, &b);
		vec[i] = {a, b};
	}
	sort(vec+1, vec+n+1);
	for(int i = 1; i <= n; i++) sum[i] = sum[i-1] + vec[i].second;
	for(int i = 1; i <= n; i++) {
		pq.push(sum[i-1] - vec[i].first);
		ans = max(sum[i] - vec[i].first - pq.top(), ans);
	}
	printf("%lld", ans);
}

Compilation message

art.cpp: In function 'int main()':
art.cpp:11:17: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
                 ^
art.cpp:14:29: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld %lld", &a, &b);
                             ^

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	252 KB	Output is correct
2	Correct	1 ms	352 KB	Output is correct
3	Correct	1 ms	424 KB	Output is correct
4	Correct	1 ms	440 KB	Output is correct
5	Correct	1 ms	476 KB	Output is correct
6	Correct	1 ms	476 KB	Output is correct
7	Correct	1 ms	532 KB	Output is correct
8	Correct	1 ms	548 KB	Output is correct
9	Correct	2 ms	548 KB	Output is correct
10	Correct	1 ms	548 KB	Output is correct
11	Correct	2 ms	548 KB	Output is correct

Subtask #2
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	252 KB	Output is correct
2	Correct	1 ms	352 KB	Output is correct
3	Correct	1 ms	424 KB	Output is correct
4	Correct	1 ms	440 KB	Output is correct
5	Correct	1 ms	476 KB	Output is correct
6	Correct	1 ms	476 KB	Output is correct
7	Correct	1 ms	532 KB	Output is correct
8	Correct	1 ms	548 KB	Output is correct
9	Correct	2 ms	548 KB	Output is correct
10	Correct	1 ms	548 KB	Output is correct
11	Correct	2 ms	548 KB	Output is correct
12	Correct	2 ms	548 KB	Output is correct
13	Correct	2 ms	676 KB	Output is correct
14	Correct	2 ms	676 KB	Output is correct
15	Correct	1 ms	676 KB	Output is correct
16	Correct	2 ms	676 KB	Output is correct
17	Correct	1 ms	676 KB	Output is correct
18	Correct	2 ms	676 KB	Output is correct
19	Correct	2 ms	676 KB	Output is correct
20	Correct	2 ms	676 KB	Output is correct
21	Correct	1 ms	676 KB	Output is correct
22	Correct	2 ms	676 KB	Output is correct
23	Correct	2 ms	676 KB	Output is correct
24	Correct	1 ms	676 KB	Output is correct
25	Correct	2 ms	676 KB	Output is correct
26	Correct	1 ms	676 KB	Output is correct

Subtask #3
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	252 KB	Output is correct
2	Correct	1 ms	352 KB	Output is correct
3	Correct	1 ms	424 KB	Output is correct
4	Correct	1 ms	440 KB	Output is correct
5	Correct	1 ms	476 KB	Output is correct
6	Correct	1 ms	476 KB	Output is correct
7	Correct	1 ms	532 KB	Output is correct
8	Correct	1 ms	548 KB	Output is correct
9	Correct	2 ms	548 KB	Output is correct
10	Correct	1 ms	548 KB	Output is correct
11	Correct	2 ms	548 KB	Output is correct
12	Correct	2 ms	548 KB	Output is correct
13	Correct	2 ms	676 KB	Output is correct
14	Correct	2 ms	676 KB	Output is correct
15	Correct	1 ms	676 KB	Output is correct
16	Correct	2 ms	676 KB	Output is correct
17	Correct	1 ms	676 KB	Output is correct
18	Correct	2 ms	676 KB	Output is correct
19	Correct	2 ms	676 KB	Output is correct
20	Correct	2 ms	676 KB	Output is correct
21	Correct	1 ms	676 KB	Output is correct
22	Correct	2 ms	676 KB	Output is correct
23	Correct	2 ms	676 KB	Output is correct
24	Correct	1 ms	676 KB	Output is correct
25	Correct	2 ms	676 KB	Output is correct
26	Correct	1 ms	676 KB	Output is correct
27	Correct	6 ms	748 KB	Output is correct
28	Correct	4 ms	748 KB	Output is correct
29	Correct	5 ms	748 KB	Output is correct
30	Correct	4 ms	748 KB	Output is correct
31	Correct	4 ms	748 KB	Output is correct
32	Correct	4 ms	748 KB	Output is correct
33	Correct	5 ms	748 KB	Output is correct
34	Correct	4 ms	748 KB	Output is correct
35	Correct	4 ms	748 KB	Output is correct
36	Correct	4 ms	784 KB	Output is correct
37	Correct	4 ms	784 KB	Output is correct
38	Correct	4 ms	784 KB	Output is correct
39	Correct	4 ms	784 KB	Output is correct
40	Correct	4 ms	784 KB	Output is correct
41	Correct	4 ms	784 KB	Output is correct
42	Correct	4 ms	784 KB	Output is correct
43	Correct	4 ms	792 KB	Output is correct
44	Correct	4 ms	792 KB	Output is correct
45	Correct	4 ms	792 KB	Output is correct
46	Correct	4 ms	792 KB	Output is correct
47	Correct	4 ms	792 KB	Output is correct
48	Correct	4 ms	792 KB	Output is correct
49	Correct	4 ms	792 KB	Output is correct
50	Correct	4 ms	792 KB	Output is correct
51	Correct	4 ms	792 KB	Output is correct

Subtask #4
50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	252 KB	Output is correct
2	Correct	1 ms	352 KB	Output is correct
3	Correct	1 ms	424 KB	Output is correct
4	Correct	1 ms	440 KB	Output is correct
5	Correct	1 ms	476 KB	Output is correct
6	Correct	1 ms	476 KB	Output is correct
7	Correct	1 ms	532 KB	Output is correct
8	Correct	1 ms	548 KB	Output is correct
9	Correct	2 ms	548 KB	Output is correct
10	Correct	1 ms	548 KB	Output is correct
11	Correct	2 ms	548 KB	Output is correct
12	Correct	2 ms	548 KB	Output is correct
13	Correct	2 ms	676 KB	Output is correct
14	Correct	2 ms	676 KB	Output is correct
15	Correct	1 ms	676 KB	Output is correct
16	Correct	2 ms	676 KB	Output is correct
17	Correct	1 ms	676 KB	Output is correct
18	Correct	2 ms	676 KB	Output is correct
19	Correct	2 ms	676 KB	Output is correct
20	Correct	2 ms	676 KB	Output is correct
21	Correct	1 ms	676 KB	Output is correct
22	Correct	2 ms	676 KB	Output is correct
23	Correct	2 ms	676 KB	Output is correct
24	Correct	1 ms	676 KB	Output is correct
25	Correct	2 ms	676 KB	Output is correct
26	Correct	1 ms	676 KB	Output is correct
27	Correct	6 ms	748 KB	Output is correct
28	Correct	4 ms	748 KB	Output is correct
29	Correct	5 ms	748 KB	Output is correct
30	Correct	4 ms	748 KB	Output is correct
31	Correct	4 ms	748 KB	Output is correct
32	Correct	4 ms	748 KB	Output is correct
33	Correct	5 ms	748 KB	Output is correct
34	Correct	4 ms	748 KB	Output is correct
35	Correct	4 ms	748 KB	Output is correct
36	Correct	4 ms	784 KB	Output is correct
37	Correct	4 ms	784 KB	Output is correct
38	Correct	4 ms	784 KB	Output is correct
39	Correct	4 ms	784 KB	Output is correct
40	Correct	4 ms	784 KB	Output is correct
41	Correct	4 ms	784 KB	Output is correct
42	Correct	4 ms	784 KB	Output is correct
43	Correct	4 ms	792 KB	Output is correct
44	Correct	4 ms	792 KB	Output is correct
45	Correct	4 ms	792 KB	Output is correct
46	Correct	4 ms	792 KB	Output is correct
47	Correct	4 ms	792 KB	Output is correct
48	Correct	4 ms	792 KB	Output is correct
49	Correct	4 ms	792 KB	Output is correct
50	Correct	4 ms	792 KB	Output is correct
51	Correct	4 ms	792 KB	Output is correct
52	Correct	279 ms	16584 KB	Output is correct
53	Correct	341 ms	16584 KB	Output is correct
54	Correct	269 ms	16600 KB	Output is correct
55	Correct	268 ms	16684 KB	Output is correct
56	Correct	274 ms	16684 KB	Output is correct
57	Correct	261 ms	16684 KB	Output is correct
58	Correct	311 ms	16684 KB	Output is correct
59	Correct	297 ms	16684 KB	Output is correct
60	Correct	256 ms	16684 KB	Output is correct
61	Correct	275 ms	16684 KB	Output is correct
62	Correct	275 ms	16684 KB	Output is correct
63	Correct	280 ms	16684 KB	Output is correct
64	Correct	257 ms	16684 KB	Output is correct
65	Correct	259 ms	16684 KB	Output is correct
66	Correct	257 ms	16684 KB	Output is correct
67	Correct	266 ms	16684 KB	Output is correct
68	Correct	313 ms	16700 KB	Output is correct

Submission #41578

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 20.0 / 20.0

Subtask #3 20.0 / 20.0

Subtask #4 50.0 / 50.0

Subtask #1
10.0 / 10.0

Subtask #2
20.0 / 20.0

Subtask #3
20.0 / 20.0

Subtask #4
50.0 / 50.0