Submission #1055476

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1055476	2024-08-12T19:53:46 Z	alex_2008	Art Exhibition (JOI18_art)	C++14	100 / 100	296 ms	20916 KB

art

#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#define ff first 
#define ss second
using namespace std;
typedef long long ll;
const int N = 500010;
pair<ll, ll> a[N];
int main() {
	int n;
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> a[i].ff >> a[i].ss;
	}
	sort(a + 1, a + n + 1);
	for (int i = 1; i <= n; i++) {
		a[i].ss += a[i - 1].ss;
	}
	ll mx = -1000000000000000000;
	ll ans = -1000000000000000000;
	for (int i = 1; i <= n; i++) {
		mx = max(mx, a[i].ff - a[i - 1].ss);
		ans = max(ans, a[i].ss - a[i].ff + mx);
	}
	cout << ans << "\n";
}

Subtask #1

10.0 / 10.0

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

Subtask #2

20.0 / 20.0

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

Subtask #3

20.0 / 20.0

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

Subtask #4

50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	440 KB	Output is correct
5	Correct	0 ms	344 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	448 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	1 ms	344 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	1 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	448 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	3 ms	604 KB	Output is correct
28	Correct	3 ms	604 KB	Output is correct
29	Correct	3 ms	604 KB	Output is correct
30	Correct	3 ms	608 KB	Output is correct
31	Correct	3 ms	640 KB	Output is correct
32	Correct	3 ms	556 KB	Output is correct
33	Correct	3 ms	604 KB	Output is correct
34	Correct	3 ms	600 KB	Output is correct
35	Correct	3 ms	604 KB	Output is correct
36	Correct	3 ms	604 KB	Output is correct
37	Correct	3 ms	604 KB	Output is correct
38	Correct	3 ms	604 KB	Output is correct
39	Correct	3 ms	604 KB	Output is correct
40	Correct	3 ms	600 KB	Output is correct
41	Correct	3 ms	604 KB	Output is correct
42	Correct	3 ms	604 KB	Output is correct
43	Correct	3 ms	640 KB	Output is correct
44	Correct	3 ms	604 KB	Output is correct
45	Correct	3 ms	556 KB	Output is correct
46	Correct	3 ms	604 KB	Output is correct
47	Correct	3 ms	604 KB	Output is correct
48	Correct	3 ms	604 KB	Output is correct
49	Correct	3 ms	604 KB	Output is correct
50	Correct	3 ms	604 KB	Output is correct
51	Correct	3 ms	604 KB	Output is correct
52	Correct	296 ms	20608 KB	Output is correct
53	Correct	267 ms	20816 KB	Output is correct
54	Correct	272 ms	20820 KB	Output is correct
55	Correct	271 ms	20816 KB	Output is correct
56	Correct	270 ms	20816 KB	Output is correct
57	Correct	273 ms	20820 KB	Output is correct
58	Correct	290 ms	20816 KB	Output is correct
59	Correct	269 ms	20668 KB	Output is correct
60	Correct	265 ms	20728 KB	Output is correct
61	Correct	264 ms	20560 KB	Output is correct
62	Correct	274 ms	20916 KB	Output is correct
63	Correct	277 ms	20820 KB	Output is correct
64	Correct	267 ms	20820 KB	Output is correct
65	Correct	269 ms	20796 KB	Output is correct
66	Correct	267 ms	20820 KB	Output is correct
67	Correct	281 ms	20728 KB	Output is correct
68	Correct	270 ms	20812 KB	Output is correct