Submission #1006857

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1006857	2024-06-24T09:20:30 Z	faqinyeager	Art Exhibition (JOI18_art)	C++17	100 / 100	343 ms	21208 KB

#include <bits/stdc++.h>
#define ff first
#define ss second
using namespace std;
using ll = long long;
 
ll n;
vector<pair<ll, ll>> a;
 
int main(){
    cin >> n;
    
    for(int i = 0; i < n; i++){
        ll x, y;
        cin >> x >> y;
        a.push_back({x, y});
    }
    
    sort(a.begin(), a.end());
    
    ll best = 0, cur = 0;
    
    for(ll i = 0; i < n; i++){
        cur += a[i].ss;
        cur = max(cur, a[i].ss + a[i].ff);
        best = max(best, cur - a[i].ff);
    }
    
    cout << best;
}

Subtask #1
10.0 / 10.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	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	0 ms	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	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	1 ms	348 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	0 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	348 KB	Output is correct
26	Correct	1 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	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	1 ms	348 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	0 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	348 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct
27	Correct	4 ms	604 KB	Output is correct
28	Correct	3 ms	604 KB	Output is correct
29	Correct	3 ms	604 KB	Output is correct
30	Correct	4 ms	604 KB	Output is correct
31	Correct	3 ms	708 KB	Output is correct
32	Correct	3 ms	604 KB	Output is correct
33	Correct	3 ms	604 KB	Output is correct
34	Correct	4 ms	608 KB	Output is correct
35	Correct	4 ms	604 KB	Output is correct
36	Correct	3 ms	604 KB	Output is correct
37	Correct	3 ms	604 KB	Output is correct
38	Correct	3 ms	604 KB	Output is correct
39	Correct	4 ms	604 KB	Output is correct
40	Correct	4 ms	668 KB	Output is correct
41	Correct	3 ms	604 KB	Output is correct
42	Correct	4 ms	604 KB	Output is correct
43	Correct	3 ms	768 KB	Output is correct
44	Correct	4 ms	604 KB	Output is correct
45	Correct	4 ms	604 KB	Output is correct
46	Correct	3 ms	604 KB	Output is correct
47	Correct	3 ms	604 KB	Output is correct
48	Correct	3 ms	660 KB	Output is correct
49	Correct	3 ms	604 KB	Output is correct
50	Correct	4 ms	604 KB	Output is correct
51	Correct	4 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	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	1 ms	348 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	0 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	348 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct
27	Correct	4 ms	604 KB	Output is correct
28	Correct	3 ms	604 KB	Output is correct
29	Correct	3 ms	604 KB	Output is correct
30	Correct	4 ms	604 KB	Output is correct
31	Correct	3 ms	708 KB	Output is correct
32	Correct	3 ms	604 KB	Output is correct
33	Correct	3 ms	604 KB	Output is correct
34	Correct	4 ms	608 KB	Output is correct
35	Correct	4 ms	604 KB	Output is correct
36	Correct	3 ms	604 KB	Output is correct
37	Correct	3 ms	604 KB	Output is correct
38	Correct	3 ms	604 KB	Output is correct
39	Correct	4 ms	604 KB	Output is correct
40	Correct	4 ms	668 KB	Output is correct
41	Correct	3 ms	604 KB	Output is correct
42	Correct	4 ms	604 KB	Output is correct
43	Correct	3 ms	768 KB	Output is correct
44	Correct	4 ms	604 KB	Output is correct
45	Correct	4 ms	604 KB	Output is correct
46	Correct	3 ms	604 KB	Output is correct
47	Correct	3 ms	604 KB	Output is correct
48	Correct	3 ms	660 KB	Output is correct
49	Correct	3 ms	604 KB	Output is correct
50	Correct	4 ms	604 KB	Output is correct
51	Correct	4 ms	604 KB	Output is correct
52	Correct	323 ms	20876 KB	Output is correct
53	Correct	313 ms	20912 KB	Output is correct
54	Correct	305 ms	20904 KB	Output is correct
55	Correct	309 ms	20904 KB	Output is correct
56	Correct	302 ms	21100 KB	Output is correct
57	Correct	316 ms	20992 KB	Output is correct
58	Correct	281 ms	20920 KB	Output is correct
59	Correct	314 ms	20912 KB	Output is correct
60	Correct	277 ms	20912 KB	Output is correct
61	Correct	319 ms	20688 KB	Output is correct
62	Correct	289 ms	21164 KB	Output is correct
63	Correct	343 ms	20988 KB	Output is correct
64	Correct	291 ms	21208 KB	Output is correct
65	Correct	283 ms	20912 KB	Output is correct
66	Correct	298 ms	20924 KB	Output is correct
67	Correct	326 ms	20908 KB	Output is correct
68	Correct	308 ms	20912 KB	Output is correct

Submission #1006857

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