Submission #258439

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
258439	2020-08-05T23:19:34 Z	SpeedOfMagic	Art Exhibition (JOI18_art)	C++17	100 / 100	822 ms	24968 KB

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

#define int long long
signed main() {
	int n; cin >> n;
	pair<int, int> p[n];
	for (int i = 0; i < n; ++i) {
		cin >> p[i].first >> p[i].second;
	}
	sort(p, p + n);
	vector<int> d(n);
	int s = 0;
	for (int i = 0; i < n; ++i) {
		s += p[i].second;
		d[i] = s - p[i].first;
	}
	for (int i = n - 2; i >= 0; --i)
		d[i] = max(d[i], d[i + 1]);
	int ans = 0;
	int pen = 0;
	for (int i = 0; i < n; ++i) {
		ans = max(ans, d[i] + p[i].first + pen);
		pen -= p[i].second;
	}
	cout << ans << endl;
	
	return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	256 KB	Output is correct
2	Correct	0 ms	256 KB	Output is correct
3	Correct	1 ms	256 KB	Output is correct
4	Correct	0 ms	256 KB	Output is correct
5	Correct	0 ms	256 KB	Output is correct
6	Correct	0 ms	256 KB	Output is correct
7	Correct	0 ms	256 KB	Output is correct
8	Correct	0 ms	256 KB	Output is correct
9	Correct	0 ms	256 KB	Output is correct
10	Correct	0 ms	256 KB	Output is correct
11	Correct	0 ms	256 KB	Output is correct
12	Correct	1 ms	384 KB	Output is correct
13	Correct	1 ms	384 KB	Output is correct
14	Correct	1 ms	384 KB	Output is correct
15	Correct	1 ms	384 KB	Output is correct
16	Correct	1 ms	384 KB	Output is correct
17	Correct	1 ms	384 KB	Output is correct
18	Correct	1 ms	384 KB	Output is correct
19	Correct	1 ms	384 KB	Output is correct
20	Correct	1 ms	384 KB	Output is correct
21	Correct	2 ms	384 KB	Output is correct
22	Correct	1 ms	384 KB	Output is correct
23	Correct	1 ms	384 KB	Output is correct
24	Correct	1 ms	256 KB	Output is correct
25	Correct	1 ms	384 KB	Output is correct
26	Correct	1 ms	384 KB	Output is correct
27	Correct	9 ms	512 KB	Output is correct
28	Correct	8 ms	512 KB	Output is correct
29	Correct	9 ms	512 KB	Output is correct
30	Correct	8 ms	572 KB	Output is correct
31	Correct	8 ms	512 KB	Output is correct
32	Correct	8 ms	512 KB	Output is correct
33	Correct	8 ms	512 KB	Output is correct
34	Correct	8 ms	512 KB	Output is correct
35	Correct	8 ms	512 KB	Output is correct
36	Correct	8 ms	512 KB	Output is correct
37	Correct	8 ms	512 KB	Output is correct
38	Correct	8 ms	512 KB	Output is correct
39	Correct	8 ms	512 KB	Output is correct
40	Correct	10 ms	512 KB	Output is correct
41	Correct	8 ms	512 KB	Output is correct
42	Correct	8 ms	512 KB	Output is correct
43	Correct	8 ms	616 KB	Output is correct
44	Correct	8 ms	512 KB	Output is correct
45	Correct	8 ms	512 KB	Output is correct
46	Correct	8 ms	512 KB	Output is correct
47	Correct	8 ms	512 KB	Output is correct
48	Correct	9 ms	640 KB	Output is correct
49	Correct	8 ms	512 KB	Output is correct
50	Correct	8 ms	512 KB	Output is correct
51	Correct	8 ms	512 KB	Output is correct

Subtask #4
50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	256 KB	Output is correct
2	Correct	0 ms	256 KB	Output is correct
3	Correct	1 ms	256 KB	Output is correct
4	Correct	0 ms	256 KB	Output is correct
5	Correct	0 ms	256 KB	Output is correct
6	Correct	0 ms	256 KB	Output is correct
7	Correct	0 ms	256 KB	Output is correct
8	Correct	0 ms	256 KB	Output is correct
9	Correct	0 ms	256 KB	Output is correct
10	Correct	0 ms	256 KB	Output is correct
11	Correct	0 ms	256 KB	Output is correct
12	Correct	1 ms	384 KB	Output is correct
13	Correct	1 ms	384 KB	Output is correct
14	Correct	1 ms	384 KB	Output is correct
15	Correct	1 ms	384 KB	Output is correct
16	Correct	1 ms	384 KB	Output is correct
17	Correct	1 ms	384 KB	Output is correct
18	Correct	1 ms	384 KB	Output is correct
19	Correct	1 ms	384 KB	Output is correct
20	Correct	1 ms	384 KB	Output is correct
21	Correct	2 ms	384 KB	Output is correct
22	Correct	1 ms	384 KB	Output is correct
23	Correct	1 ms	384 KB	Output is correct
24	Correct	1 ms	256 KB	Output is correct
25	Correct	1 ms	384 KB	Output is correct
26	Correct	1 ms	384 KB	Output is correct
27	Correct	9 ms	512 KB	Output is correct
28	Correct	8 ms	512 KB	Output is correct
29	Correct	9 ms	512 KB	Output is correct
30	Correct	8 ms	572 KB	Output is correct
31	Correct	8 ms	512 KB	Output is correct
32	Correct	8 ms	512 KB	Output is correct
33	Correct	8 ms	512 KB	Output is correct
34	Correct	8 ms	512 KB	Output is correct
35	Correct	8 ms	512 KB	Output is correct
36	Correct	8 ms	512 KB	Output is correct
37	Correct	8 ms	512 KB	Output is correct
38	Correct	8 ms	512 KB	Output is correct
39	Correct	8 ms	512 KB	Output is correct
40	Correct	10 ms	512 KB	Output is correct
41	Correct	8 ms	512 KB	Output is correct
42	Correct	8 ms	512 KB	Output is correct
43	Correct	8 ms	616 KB	Output is correct
44	Correct	8 ms	512 KB	Output is correct
45	Correct	8 ms	512 KB	Output is correct
46	Correct	8 ms	512 KB	Output is correct
47	Correct	8 ms	512 KB	Output is correct
48	Correct	9 ms	640 KB	Output is correct
49	Correct	8 ms	512 KB	Output is correct
50	Correct	8 ms	512 KB	Output is correct
51	Correct	8 ms	512 KB	Output is correct
52	Correct	775 ms	24828 KB	Output is correct
53	Correct	800 ms	24744 KB	Output is correct
54	Correct	796 ms	24824 KB	Output is correct
55	Correct	788 ms	24712 KB	Output is correct
56	Correct	787 ms	24696 KB	Output is correct
57	Correct	788 ms	24824 KB	Output is correct
58	Correct	793 ms	24968 KB	Output is correct
59	Correct	793 ms	24840 KB	Output is correct
60	Correct	787 ms	24824 KB	Output is correct
61	Correct	800 ms	24568 KB	Output is correct
62	Correct	805 ms	24696 KB	Output is correct
63	Correct	802 ms	24696 KB	Output is correct
64	Correct	822 ms	24696 KB	Output is correct
65	Correct	811 ms	24696 KB	Output is correct
66	Correct	792 ms	24840 KB	Output is correct
67	Correct	790 ms	24968 KB	Output is correct
68	Correct	789 ms	24712 KB	Output is correct

Submission #258439

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