Submission #136653

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
136653	2019-07-26T03:28:05 Z	junodeveloper	Art Exhibition (JOI18_art)	C++14	100 / 100	274 ms	24824 KB

#include <bits/stdc++.h>
#define sz(x) ((int)x.size())
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
int n;
ll s[500010];
pll a[500010];
int main() {
	scanf("%d",&n);
	int i;
	for(i=1;i<=n;i++) {
		scanf("%lld%lld",&a[i].fi,&a[i].se);
	}
	sort(a+1,a+n+1);
	for(i=1;i<=n;i++) {
		s[i]=s[i-1]+a[i].se;
	}
	ll mx=-9e18,res=-9e18;
	for(i=n;i>=1;i--) {
		mx=max(mx,s[i]-a[i].fi);
		res=max(res, mx-s[i-1]+a[i].fi);
	}
	printf("%lld",res);
	return 0;
}

Compilation message

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

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	380 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	256 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	2 ms	376 KB	Output is correct
11	Correct	2 ms	376 KB	Output is correct
12	Correct	2 ms	376 KB	Output is correct
13	Correct	2 ms	376 KB	Output is correct
14	Correct	2 ms	376 KB	Output is correct
15	Correct	2 ms	376 KB	Output is correct
16	Correct	3 ms	376 KB	Output is correct
17	Correct	3 ms	376 KB	Output is correct
18	Correct	3 ms	376 KB	Output is correct
19	Correct	2 ms	376 KB	Output is correct
20	Correct	3 ms	348 KB	Output is correct
21	Correct	2 ms	376 KB	Output is correct
22	Correct	2 ms	376 KB	Output is correct
23	Correct	2 ms	376 KB	Output is correct
24	Correct	2 ms	376 KB	Output is correct
25	Correct	2 ms	376 KB	Output is correct
26	Correct	3 ms	376 KB	Output is correct
27	Correct	5 ms	632 KB	Output is correct
28	Correct	5 ms	632 KB	Output is correct
29	Correct	5 ms	540 KB	Output is correct
30	Correct	5 ms	632 KB	Output is correct
31	Correct	5 ms	632 KB	Output is correct
32	Correct	5 ms	632 KB	Output is correct
33	Correct	5 ms	632 KB	Output is correct
34	Correct	5 ms	632 KB	Output is correct
35	Correct	5 ms	632 KB	Output is correct
36	Correct	4 ms	504 KB	Output is correct
37	Correct	5 ms	632 KB	Output is correct
38	Correct	4 ms	504 KB	Output is correct
39	Correct	4 ms	504 KB	Output is correct
40	Correct	5 ms	504 KB	Output is correct
41	Correct	4 ms	504 KB	Output is correct
42	Correct	4 ms	636 KB	Output is correct
43	Correct	5 ms	632 KB	Output is correct
44	Correct	5 ms	632 KB	Output is correct
45	Correct	5 ms	632 KB	Output is correct
46	Correct	5 ms	632 KB	Output is correct
47	Correct	5 ms	636 KB	Output is correct
48	Correct	5 ms	556 KB	Output is correct
49	Correct	4 ms	552 KB	Output is correct
50	Correct	5 ms	632 KB	Output is correct
51	Correct	5 ms	632 KB	Output is correct
52	Correct	274 ms	23972 KB	Output is correct
53	Correct	267 ms	24128 KB	Output is correct
54	Correct	265 ms	24132 KB	Output is correct
55	Correct	266 ms	24004 KB	Output is correct
56	Correct	264 ms	24068 KB	Output is correct
57	Correct	266 ms	23956 KB	Output is correct
58	Correct	264 ms	24696 KB	Output is correct
59	Correct	269 ms	24756 KB	Output is correct
60	Correct	269 ms	24732 KB	Output is correct
61	Correct	269 ms	24544 KB	Output is correct
62	Correct	266 ms	24788 KB	Output is correct
63	Correct	267 ms	24696 KB	Output is correct
64	Correct	265 ms	24824 KB	Output is correct
65	Correct	267 ms	24648 KB	Output is correct
66	Correct	264 ms	23780 KB	Output is correct
67	Correct	264 ms	24732 KB	Output is correct
68	Correct	259 ms	24780 KB	Output is correct

Submission #136653

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