Submission #1018115

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1018115	2024-07-09T14:36:56 Z	ag_1204	Art Exhibition (JOI18_art)	C++14	100 / 100	134 ms	31028 KB

#include<bits/stdc++.h>
using namespace std;
#define int long long int
#define pii pair<int,int>
#define vi vector<int>
#define si set<int>
#define pb push_back
 
void solve() {
    int n; cin>>n;
    pii v[n+1];
    for (int i=1;i<=n;i++) {
        cin>>v[i].first>>v[i].second;
    }
    sort(v+1, v+n+1);
    int ans = 0;
    int sum[n+1];
    for(int i = 1; i <= n; ++i) {
        sum[i] = sum[i - 1] + v[i].second;
        ans = max(ans, 1ll * v[i].second);
    }
    priority_queue<int, vector<int>, greater<int>> pq;
    for(int i = 1; i <= n; ++i) {
        if(!pq.empty()) {
            int top = pq.top();
            ans = max(ans, sum[i] - v[i].first - top);
        }
        pq.push(sum[i - 1] - v[i].first);
    }
    cout << ans;
    return;
}
 
int32_t main() {
	ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
	int tt=1; //cin>>tt;
	while(tt--) {
	    solve();
	}
	return 0;
}

Subtask #1
10.0 / 10.0

#	Verdict	Memory	Grader output
1	Correct	344 KB	Output is correct
2	Correct	600 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	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	344 KB	Output is correct
2	Correct	0 ms	600 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	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	348 KB	Output is correct
15	Correct	0 ms	468 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	0 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	1 ms	600 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	600 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	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	348 KB	Output is correct
15	Correct	0 ms	468 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	0 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	1 ms	600 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	1 ms	604 KB	Output is correct
28	Correct	2 ms	604 KB	Output is correct
29	Correct	2 ms	660 KB	Output is correct
30	Correct	2 ms	604 KB	Output is correct
31	Correct	2 ms	752 KB	Output is correct
32	Correct	2 ms	604 KB	Output is correct
33	Correct	2 ms	600 KB	Output is correct
34	Correct	2 ms	604 KB	Output is correct
35	Correct	1 ms	644 KB	Output is correct
36	Correct	1 ms	604 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	604 KB	Output is correct
41	Correct	1 ms	604 KB	Output is correct
42	Correct	2 ms	600 KB	Output is correct
43	Correct	2 ms	600 KB	Output is correct
44	Correct	2 ms	604 KB	Output is correct
45	Correct	1 ms	604 KB	Output is correct
46	Correct	1 ms	720 KB	Output is correct
47	Correct	2 ms	604 KB	Output is correct
48	Correct	1 ms	604 KB	Output is correct
49	Correct	1 ms	604 KB	Output is correct
50	Correct	2 ms	632 KB	Output is correct
51	Correct	2 ms	600 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	600 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	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	348 KB	Output is correct
15	Correct	0 ms	468 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	0 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	1 ms	600 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	1 ms	604 KB	Output is correct
28	Correct	2 ms	604 KB	Output is correct
29	Correct	2 ms	660 KB	Output is correct
30	Correct	2 ms	604 KB	Output is correct
31	Correct	2 ms	752 KB	Output is correct
32	Correct	2 ms	604 KB	Output is correct
33	Correct	2 ms	600 KB	Output is correct
34	Correct	2 ms	604 KB	Output is correct
35	Correct	1 ms	644 KB	Output is correct
36	Correct	1 ms	604 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	604 KB	Output is correct
41	Correct	1 ms	604 KB	Output is correct
42	Correct	2 ms	600 KB	Output is correct
43	Correct	2 ms	600 KB	Output is correct
44	Correct	2 ms	604 KB	Output is correct
45	Correct	1 ms	604 KB	Output is correct
46	Correct	1 ms	720 KB	Output is correct
47	Correct	2 ms	604 KB	Output is correct
48	Correct	1 ms	604 KB	Output is correct
49	Correct	1 ms	604 KB	Output is correct
50	Correct	2 ms	632 KB	Output is correct
51	Correct	2 ms	600 KB	Output is correct
52	Correct	134 ms	30000 KB	Output is correct
53	Correct	134 ms	31028 KB	Output is correct
54	Correct	127 ms	29736 KB	Output is correct
55	Correct	127 ms	30760 KB	Output is correct
56	Correct	122 ms	28876 KB	Output is correct
57	Correct	123 ms	30924 KB	Output is correct
58	Correct	120 ms	28968 KB	Output is correct
59	Correct	122 ms	30408 KB	Output is correct
60	Correct	125 ms	30388 KB	Output is correct
61	Correct	130 ms	30664 KB	Output is correct
62	Correct	122 ms	29864 KB	Output is correct
63	Correct	118 ms	28872 KB	Output is correct
64	Correct	123 ms	30008 KB	Output is correct
65	Correct	120 ms	30372 KB	Output is correct
66	Correct	120 ms	30152 KB	Output is correct
67	Correct	119 ms	30156 KB	Output is correct
68	Correct	118 ms	29224 KB	Output is correct

Submission #1018115

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