Submission #754319

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
754319	2023-06-07T13:44:43 Z	KN200711	Art Exhibition (JOI18_art)	C++14	100 / 100	206 ms	20764 KB

# include <bits/stdc++.h>
# define ll long long
# define fi first
# define se second
using namespace std;

int main() {
	int N;
	scanf("%d", &N);
	
	vector< pair<ll, ll> > arr(N);
	for(int i=0;i<N;i++) scanf("%lld %lld", &arr[i].fi, &arr[i].se);
	
	sort(arr.begin(), arr.end());
	ll mn = 1e18, pref = 0ll, ans = 0ll;
	for(int i=0;i<N;i++) {
		mn = min(mn, pref - 1ll * arr[i].fi);
		pref += arr[i].se;
		ans = max(ans, pref - arr[i].fi - mn);
	}
	printf("%lld\n", ans);
}

Compilation message

art.cpp: In function 'int main()':
art.cpp:9:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    9 |  scanf("%d", &N);
      |  ~~~~~^~~~~~~~~~
art.cpp:12:28: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   12 |  for(int i=0;i<N;i++) scanf("%lld %lld", &arr[i].fi, &arr[i].se);
      |                       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	300 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	296 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	1 ms	308 KB	Output is correct
13	Correct	1 ms	300 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	300 KB	Output is correct
18	Correct	1 ms	300 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	1 ms	304 KB	Output is correct
22	Correct	1 ms	212 KB	Output is correct
23	Correct	1 ms	212 KB	Output is correct
24	Correct	1 ms	212 KB	Output is correct
25	Correct	1 ms	212 KB	Output is correct
26	Correct	1 ms	212 KB	Output is correct
27	Correct	2 ms	468 KB	Output is correct
28	Correct	2 ms	468 KB	Output is correct
29	Correct	2 ms	440 KB	Output is correct
30	Correct	2 ms	508 KB	Output is correct
31	Correct	2 ms	468 KB	Output is correct
32	Correct	2 ms	444 KB	Output is correct
33	Correct	3 ms	500 KB	Output is correct
34	Correct	3 ms	468 KB	Output is correct
35	Correct	2 ms	468 KB	Output is correct
36	Correct	3 ms	444 KB	Output is correct
37	Correct	2 ms	468 KB	Output is correct
38	Correct	3 ms	488 KB	Output is correct
39	Correct	2 ms	504 KB	Output is correct
40	Correct	3 ms	512 KB	Output is correct
41	Correct	3 ms	468 KB	Output is correct
42	Correct	2 ms	468 KB	Output is correct
43	Correct	3 ms	468 KB	Output is correct
44	Correct	3 ms	444 KB	Output is correct
45	Correct	3 ms	436 KB	Output is correct
46	Correct	2 ms	468 KB	Output is correct
47	Correct	2 ms	484 KB	Output is correct
48	Correct	4 ms	484 KB	Output is correct
49	Correct	2 ms	468 KB	Output is correct
50	Correct	3 ms	468 KB	Output is correct
51	Correct	3 ms	500 KB	Output is correct

Subtask #4
50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	300 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	296 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	1 ms	308 KB	Output is correct
13	Correct	1 ms	300 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	300 KB	Output is correct
18	Correct	1 ms	300 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	1 ms	304 KB	Output is correct
22	Correct	1 ms	212 KB	Output is correct
23	Correct	1 ms	212 KB	Output is correct
24	Correct	1 ms	212 KB	Output is correct
25	Correct	1 ms	212 KB	Output is correct
26	Correct	1 ms	212 KB	Output is correct
27	Correct	2 ms	468 KB	Output is correct
28	Correct	2 ms	468 KB	Output is correct
29	Correct	2 ms	440 KB	Output is correct
30	Correct	2 ms	508 KB	Output is correct
31	Correct	2 ms	468 KB	Output is correct
32	Correct	2 ms	444 KB	Output is correct
33	Correct	3 ms	500 KB	Output is correct
34	Correct	3 ms	468 KB	Output is correct
35	Correct	2 ms	468 KB	Output is correct
36	Correct	3 ms	444 KB	Output is correct
37	Correct	2 ms	468 KB	Output is correct
38	Correct	3 ms	488 KB	Output is correct
39	Correct	2 ms	504 KB	Output is correct
40	Correct	3 ms	512 KB	Output is correct
41	Correct	3 ms	468 KB	Output is correct
42	Correct	2 ms	468 KB	Output is correct
43	Correct	3 ms	468 KB	Output is correct
44	Correct	3 ms	444 KB	Output is correct
45	Correct	3 ms	436 KB	Output is correct
46	Correct	2 ms	468 KB	Output is correct
47	Correct	2 ms	484 KB	Output is correct
48	Correct	4 ms	484 KB	Output is correct
49	Correct	2 ms	468 KB	Output is correct
50	Correct	3 ms	468 KB	Output is correct
51	Correct	3 ms	500 KB	Output is correct
52	Correct	180 ms	20640 KB	Output is correct
53	Correct	177 ms	20648 KB	Output is correct
54	Correct	183 ms	20760 KB	Output is correct
55	Correct	172 ms	20648 KB	Output is correct
56	Correct	185 ms	20648 KB	Output is correct
57	Correct	175 ms	20764 KB	Output is correct
58	Correct	171 ms	20660 KB	Output is correct
59	Correct	191 ms	20656 KB	Output is correct
60	Correct	191 ms	20764 KB	Output is correct
61	Correct	173 ms	20632 KB	Output is correct
62	Correct	200 ms	20648 KB	Output is correct
63	Correct	206 ms	20652 KB	Output is correct
64	Correct	181 ms	20644 KB	Output is correct
65	Correct	188 ms	20648 KB	Output is correct
66	Correct	181 ms	20764 KB	Output is correct
67	Correct	177 ms	20760 KB	Output is correct
68	Correct	182 ms	20664 KB	Output is correct

Submission #754319

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