Submission #708643

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
708643	2023-03-12T06:02:30 Z	myrcella	Art Exhibition (JOI18_art)	C++17	100 / 100	210 ms	24704 KB

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

#define fi first
#define se second
#define pii pair<int,int>
#define pll pair<long long,long long>
#define pb push_back
#define debug(x) cerr<<#x<<"="<<x<<endl
#define pq priority_queue
#define inf 0x3f
#define rep(i,a,b) for (int i=a;i<(b);i++)
#define MP make_pair
#define SZ(x) (int(x.size()))
#define ll long long
#define mod 1000000007
#define ALL(x) x.begin(),x.end()
void inc(int &a,int b) {a=(a+b)%mod;}
void dec(int &a,int b) {a=(a-b+mod)%mod;}
int lowbit(int x) {return x&(-x);}
ll p0w(ll base,ll p) {ll ret=1;while(p>0){if (p%2ll==1ll) ret=ret*base%mod;base=base*base%mod;p/=2ll;}return ret;}

const int maxn = 5e5+10;

int n;
pll a[maxn];
ll sum[maxn];

int main() {
//	freopen("input.txt","r",stdin);	
	std::ios::sync_with_stdio(false);cin.tie(0);
	cin>>n;
	rep(i,1,n+1) cin>>a[i].fi>>a[i].se;
	sort(a+1,a+n+1);
	ll mn = 1e17;
	ll ans = 0;
	rep(i,1,n+1) {
		sum[i] = sum[i-1]+a[i].se;
		mn = min(mn,sum[i-1]-a[i].fi);
		ans = max(ans,sum[i]-a[i].fi-mn);
	}
	cout<<ans;
	return 0;
}

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	340 KB	Output is correct
3	Correct	1 ms	324 KB	Output is correct
4	Correct	1 ms	324 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	1 ms	332 KB	Output is correct
10	Correct	1 ms	328 KB	Output is correct
11	Correct	0 ms	340 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	340 KB	Output is correct
3	Correct	1 ms	324 KB	Output is correct
4	Correct	1 ms	324 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	1 ms	332 KB	Output is correct
10	Correct	1 ms	328 KB	Output is correct
11	Correct	0 ms	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	332 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	1 ms	340 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	1 ms	340 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	340 KB	Output is correct
3	Correct	1 ms	324 KB	Output is correct
4	Correct	1 ms	324 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	1 ms	332 KB	Output is correct
10	Correct	1 ms	328 KB	Output is correct
11	Correct	0 ms	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	332 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	1 ms	340 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	1 ms	340 KB	Output is correct
27	Correct	3 ms	468 KB	Output is correct
28	Correct	2 ms	584 KB	Output is correct
29	Correct	3 ms	468 KB	Output is correct
30	Correct	3 ms	468 KB	Output is correct
31	Correct	3 ms	468 KB	Output is correct
32	Correct	3 ms	468 KB	Output is correct
33	Correct	4 ms	468 KB	Output is correct
34	Correct	2 ms	536 KB	Output is correct
35	Correct	2 ms	468 KB	Output is correct
36	Correct	2 ms	468 KB	Output is correct
37	Correct	3 ms	468 KB	Output is correct
38	Correct	2 ms	584 KB	Output is correct
39	Correct	3 ms	544 KB	Output is correct
40	Correct	3 ms	468 KB	Output is correct
41	Correct	3 ms	464 KB	Output is correct
42	Correct	3 ms	580 KB	Output is correct
43	Correct	3 ms	464 KB	Output is correct
44	Correct	3 ms	544 KB	Output is correct
45	Correct	2 ms	584 KB	Output is correct
46	Correct	3 ms	468 KB	Output is correct
47	Correct	3 ms	468 KB	Output is correct
48	Correct	3 ms	536 KB	Output is correct
49	Correct	2 ms	584 KB	Output is correct
50	Correct	2 ms	468 KB	Output is correct
51	Correct	2 ms	468 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	340 KB	Output is correct
3	Correct	1 ms	324 KB	Output is correct
4	Correct	1 ms	324 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	1 ms	332 KB	Output is correct
10	Correct	1 ms	328 KB	Output is correct
11	Correct	0 ms	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	332 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	1 ms	340 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	1 ms	340 KB	Output is correct
27	Correct	3 ms	468 KB	Output is correct
28	Correct	2 ms	584 KB	Output is correct
29	Correct	3 ms	468 KB	Output is correct
30	Correct	3 ms	468 KB	Output is correct
31	Correct	3 ms	468 KB	Output is correct
32	Correct	3 ms	468 KB	Output is correct
33	Correct	4 ms	468 KB	Output is correct
34	Correct	2 ms	536 KB	Output is correct
35	Correct	2 ms	468 KB	Output is correct
36	Correct	2 ms	468 KB	Output is correct
37	Correct	3 ms	468 KB	Output is correct
38	Correct	2 ms	584 KB	Output is correct
39	Correct	3 ms	544 KB	Output is correct
40	Correct	3 ms	468 KB	Output is correct
41	Correct	3 ms	464 KB	Output is correct
42	Correct	3 ms	580 KB	Output is correct
43	Correct	3 ms	464 KB	Output is correct
44	Correct	3 ms	544 KB	Output is correct
45	Correct	2 ms	584 KB	Output is correct
46	Correct	3 ms	468 KB	Output is correct
47	Correct	3 ms	468 KB	Output is correct
48	Correct	3 ms	536 KB	Output is correct
49	Correct	2 ms	584 KB	Output is correct
50	Correct	2 ms	468 KB	Output is correct
51	Correct	2 ms	468 KB	Output is correct
52	Correct	186 ms	24692 KB	Output is correct
53	Correct	204 ms	24624 KB	Output is correct
54	Correct	199 ms	24644 KB	Output is correct
55	Correct	190 ms	24636 KB	Output is correct
56	Correct	187 ms	24572 KB	Output is correct
57	Correct	181 ms	24624 KB	Output is correct
58	Correct	203 ms	24628 KB	Output is correct
59	Correct	210 ms	24620 KB	Output is correct
60	Correct	182 ms	24628 KB	Output is correct
61	Correct	181 ms	24492 KB	Output is correct
62	Correct	185 ms	24704 KB	Output is correct
63	Correct	186 ms	24564 KB	Output is correct
64	Correct	203 ms	24604 KB	Output is correct
65	Correct	185 ms	24680 KB	Output is correct
66	Correct	205 ms	24692 KB	Output is correct
67	Correct	188 ms	24692 KB	Output is correct
68	Correct	185 ms	24648 KB	Output is correct

Submission #708643

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