Submission #887922

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
887922	2023-12-15T13:38:31 Z	hafo	Art Exhibition (JOI18_art)	C++14	100 / 100	138 ms	21264 KB

#include <bits/stdc++.h>
#define ll long long
#define ull unsigned ll
#define pb push_back
#define pa pair<int, int>
#define pall pair<ll, int>
#define fi first
#define se second
#define TASK "test"
#define Size(x) (int) x.size()
#define all(x) x.begin(), x.end()
using namespace std;

template<typename T1, typename T2> bool mini (T1 &a, T2 b) {if(a > b) a = b; else return 0; return 1;}
template<typename T1, typename T2> bool maxi (T1 &a, T2 b) {if(a < b) a = b; else return 0; return 1;}

const int MOD = 1e9 + 7;
const int LOG = 20;
const int maxn = 5e5 + 7;
const ll oo = 1e18 + 69;

int n;
pall a[maxn];

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    //freopen(TASK".inp", "r", stdin);
    //freopen(TASK".out", "w", stdout);

    cin>>n;
    for(int i = 1; i <= n; i++) cin>>a[i].fi>>a[i].se;
    sort(a + 1, a + 1 + n);
    
    ll ans = 0, mn = oo, sum = 0;
    for(int i = 1; i <= n; i++) {
        mini(mn, sum - a[i].fi);
        sum += a[i].se;
        maxi(ans, sum - a[i].fi - mn);
    }
    cout<<ans;

    return 0;
}

Subtask #1
10.0 / 10.0

#	Verdict	Memory	Grader output
1	Correct	344 KB	Output is correct
2	Correct	348 KB	Output is correct
3	Correct	348 KB	Output is correct
4	Correct	348 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	344 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	344 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	348 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	344 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	424 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	468 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	1 ms	348 KB	Output is correct
22	Correct	1 ms	348 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	0 ms	472 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	344 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	348 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	344 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	424 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	468 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	1 ms	348 KB	Output is correct
22	Correct	1 ms	348 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	0 ms	472 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	2 ms	604 KB	Output is correct
28	Correct	2 ms	604 KB	Output is correct
29	Correct	2 ms	596 KB	Output is correct
30	Correct	2 ms	604 KB	Output is correct
31	Correct	2 ms	604 KB	Output is correct
32	Correct	2 ms	600 KB	Output is correct
33	Correct	2 ms	1372 KB	Output is correct
34	Correct	2 ms	604 KB	Output is correct
35	Correct	1 ms	604 KB	Output is correct
36	Correct	1 ms	600 KB	Output is correct
37	Correct	1 ms	604 KB	Output is correct
38	Correct	2 ms	604 KB	Output is correct
39	Correct	1 ms	604 KB	Output is correct
40	Correct	2 ms	856 KB	Output is correct
41	Correct	2 ms	604 KB	Output is correct
42	Correct	1 ms	604 KB	Output is correct
43	Correct	2 ms	604 KB	Output is correct
44	Correct	2 ms	600 KB	Output is correct
45	Correct	2 ms	668 KB	Output is correct
46	Correct	2 ms	604 KB	Output is correct
47	Correct	2 ms	604 KB	Output is correct
48	Correct	2 ms	472 KB	Output is correct
49	Correct	2 ms	604 KB	Output is correct
50	Correct	2 ms	632 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	344 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	348 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	344 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	424 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	468 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	1 ms	348 KB	Output is correct
22	Correct	1 ms	348 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	0 ms	472 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	2 ms	604 KB	Output is correct
28	Correct	2 ms	604 KB	Output is correct
29	Correct	2 ms	596 KB	Output is correct
30	Correct	2 ms	604 KB	Output is correct
31	Correct	2 ms	604 KB	Output is correct
32	Correct	2 ms	600 KB	Output is correct
33	Correct	2 ms	1372 KB	Output is correct
34	Correct	2 ms	604 KB	Output is correct
35	Correct	1 ms	604 KB	Output is correct
36	Correct	1 ms	600 KB	Output is correct
37	Correct	1 ms	604 KB	Output is correct
38	Correct	2 ms	604 KB	Output is correct
39	Correct	1 ms	604 KB	Output is correct
40	Correct	2 ms	856 KB	Output is correct
41	Correct	2 ms	604 KB	Output is correct
42	Correct	1 ms	604 KB	Output is correct
43	Correct	2 ms	604 KB	Output is correct
44	Correct	2 ms	600 KB	Output is correct
45	Correct	2 ms	668 KB	Output is correct
46	Correct	2 ms	604 KB	Output is correct
47	Correct	2 ms	604 KB	Output is correct
48	Correct	2 ms	472 KB	Output is correct
49	Correct	2 ms	604 KB	Output is correct
50	Correct	2 ms	632 KB	Output is correct
51	Correct	2 ms	604 KB	Output is correct
52	Correct	135 ms	20848 KB	Output is correct
53	Correct	128 ms	20872 KB	Output is correct
54	Correct	126 ms	20820 KB	Output is correct
55	Correct	124 ms	20904 KB	Output is correct
56	Correct	123 ms	20816 KB	Output is correct
57	Correct	138 ms	20844 KB	Output is correct
58	Correct	124 ms	20712 KB	Output is correct
59	Correct	124 ms	20840 KB	Output is correct
60	Correct	132 ms	20820 KB	Output is correct
61	Correct	125 ms	20560 KB	Output is correct
62	Correct	136 ms	20884 KB	Output is correct
63	Correct	123 ms	20784 KB	Output is correct
64	Correct	125 ms	20708 KB	Output is correct
65	Correct	128 ms	20900 KB	Output is correct
66	Correct	126 ms	20792 KB	Output is correct
67	Correct	133 ms	20904 KB	Output is correct
68	Correct	129 ms	21264 KB	Output is correct

Submission #887922

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