Submission #1003677

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1003677	2024-06-20T15:11:35 Z	Luvidi	Art Exhibition (JOI18_art)	C++17	100 / 100	125 ms	24772 KB

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

#define ll long long
#define pll pair<ll, ll>
#define pii pair<int, int>
#define fs first
#define sc second
#define pb push_back

void solve() {
    int n;
    cin>>n;
    pll a[n];
    for(pll &p:a)cin>>p.fs>>p.sc;
    sort(a,a+n);
    ll pre[n+1];
    pre[0]=0;
    for(int i=1;i<=n;i++)pre[i]=pre[i-1]+a[i-1].sc;
    ll x=1e18,ans=0;
    for(int i=0;i<n;i++){
        x=min(x,pre[i]-a[i].fs);
        ans=max(ans,pre[i+1]-a[i].fs-x);
    }
    cout<<ans;
}

int main() {   
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    solve();
}

Subtask #1
10.0 / 10.0

#	Verdict	Memory	Grader output
1	Correct	348 KB	Output is correct
2	Correct	348 KB	Output is correct
3	Correct	348 KB	Output is correct
4	Correct	452 KB	Output is correct
5	Correct	348 KB	Output is correct
6	Correct	348 KB	Output is correct
7	Correct	348 KB	Output is correct
8	Correct	348 KB	Output is correct
9	Correct	348 KB	Output is correct
10	Correct	348 KB	Output is correct
11	Correct	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	452 KB	Output is correct
5	Correct	0 ms	348 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	348 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	0 ms	348 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 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	460 KB	Output is correct
26	Correct	0 ms	344 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	452 KB	Output is correct
5	Correct	0 ms	348 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	348 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	0 ms	348 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 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	460 KB	Output is correct
26	Correct	0 ms	344 KB	Output is correct
27	Correct	1 ms	604 KB	Output is correct
28	Correct	1 ms	544 KB	Output is correct
29	Correct	1 ms	604 KB	Output is correct
30	Correct	1 ms	604 KB	Output is correct
31	Correct	1 ms	468 KB	Output is correct
32	Correct	1 ms	604 KB	Output is correct
33	Correct	1 ms	468 KB	Output is correct
34	Correct	1 ms	604 KB	Output is correct
35	Correct	1 ms	604 KB	Output is correct
36	Correct	2 ms	604 KB	Output is correct
37	Correct	1 ms	604 KB	Output is correct
38	Correct	1 ms	604 KB	Output is correct
39	Correct	1 ms	604 KB	Output is correct
40	Correct	1 ms	604 KB	Output is correct
41	Correct	1 ms	604 KB	Output is correct
42	Correct	2 ms	660 KB	Output is correct
43	Correct	1 ms	604 KB	Output is correct
44	Correct	1 ms	580 KB	Output is correct
45	Correct	1 ms	604 KB	Output is correct
46	Correct	1 ms	604 KB	Output is correct
47	Correct	1 ms	604 KB	Output is correct
48	Correct	1 ms	468 KB	Output is correct
49	Correct	1 ms	604 KB	Output is correct
50	Correct	1 ms	604 KB	Output is correct
51	Correct	2 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	452 KB	Output is correct
5	Correct	0 ms	348 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	348 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	0 ms	348 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 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	460 KB	Output is correct
26	Correct	0 ms	344 KB	Output is correct
27	Correct	1 ms	604 KB	Output is correct
28	Correct	1 ms	544 KB	Output is correct
29	Correct	1 ms	604 KB	Output is correct
30	Correct	1 ms	604 KB	Output is correct
31	Correct	1 ms	468 KB	Output is correct
32	Correct	1 ms	604 KB	Output is correct
33	Correct	1 ms	468 KB	Output is correct
34	Correct	1 ms	604 KB	Output is correct
35	Correct	1 ms	604 KB	Output is correct
36	Correct	2 ms	604 KB	Output is correct
37	Correct	1 ms	604 KB	Output is correct
38	Correct	1 ms	604 KB	Output is correct
39	Correct	1 ms	604 KB	Output is correct
40	Correct	1 ms	604 KB	Output is correct
41	Correct	1 ms	604 KB	Output is correct
42	Correct	2 ms	660 KB	Output is correct
43	Correct	1 ms	604 KB	Output is correct
44	Correct	1 ms	580 KB	Output is correct
45	Correct	1 ms	604 KB	Output is correct
46	Correct	1 ms	604 KB	Output is correct
47	Correct	1 ms	604 KB	Output is correct
48	Correct	1 ms	468 KB	Output is correct
49	Correct	1 ms	604 KB	Output is correct
50	Correct	1 ms	604 KB	Output is correct
51	Correct	2 ms	604 KB	Output is correct
52	Correct	122 ms	24656 KB	Output is correct
53	Correct	122 ms	24748 KB	Output is correct
54	Correct	116 ms	24768 KB	Output is correct
55	Correct	111 ms	24620 KB	Output is correct
56	Correct	105 ms	24772 KB	Output is correct
57	Correct	115 ms	24768 KB	Output is correct
58	Correct	108 ms	24624 KB	Output is correct
59	Correct	110 ms	24660 KB	Output is correct
60	Correct	109 ms	24656 KB	Output is correct
61	Correct	111 ms	24620 KB	Output is correct
62	Correct	109 ms	24656 KB	Output is correct
63	Correct	112 ms	24760 KB	Output is correct
64	Correct	125 ms	24752 KB	Output is correct
65	Correct	111 ms	24656 KB	Output is correct
66	Correct	117 ms	24656 KB	Output is correct
67	Correct	112 ms	24752 KB	Output is correct
68	Correct	125 ms	24620 KB	Output is correct

Submission #1003677

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