Submission #1108379

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1108379	2024-11-04T02:53:37 Z	vjudge1	Art Exhibition (JOI18_art)	C++17	100 / 100	137 ms	18440 KB

#include <bits/stdc++.h>

#define int int64_t
#define ii pair<int , int> 
#define fi first 
#define se second
#define FOR(i , l , r) for(int i = l ; i <= r ; i++)
#define FORD(i , r , l) for(int i = r ; i >= l ; i--)

using namespace std;

const int N = 5e5;

int n , res;
int pre[N + 2];
priority_queue<int> que;
ii a[N + 2];

signed main()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> n;
    FOR(i , 1 , n) cin >> a[i].fi >> a[i].se;
    sort(a + 1 , a + n + 1);
    FOR(i , 1 , n) pre[i] = pre[i - 1] + a[i].se;
    que.push(0);
    FOR(i , 1 , n)
    {
        que.push(a[i].fi - pre[i - 1]);
        res = max(res , pre[i] - a[i].fi + que.top());
    }
    cout << res;
}

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2384 KB	Output is correct
2	Correct	1 ms	2384 KB	Output is correct
3	Correct	1 ms	2384 KB	Output is correct
4	Correct	1 ms	2384 KB	Output is correct
5	Correct	1 ms	2384 KB	Output is correct
6	Correct	1 ms	2384 KB	Output is correct
7	Correct	1 ms	2384 KB	Output is correct
8	Correct	1 ms	2384 KB	Output is correct
9	Correct	1 ms	2384 KB	Output is correct
10	Correct	1 ms	2384 KB	Output is correct
11	Correct	1 ms	2384 KB	Output is correct

Subtask #2
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2384 KB	Output is correct
2	Correct	1 ms	2384 KB	Output is correct
3	Correct	1 ms	2384 KB	Output is correct
4	Correct	1 ms	2384 KB	Output is correct
5	Correct	1 ms	2384 KB	Output is correct
6	Correct	1 ms	2384 KB	Output is correct
7	Correct	1 ms	2384 KB	Output is correct
8	Correct	1 ms	2384 KB	Output is correct
9	Correct	1 ms	2384 KB	Output is correct
10	Correct	1 ms	2384 KB	Output is correct
11	Correct	1 ms	2384 KB	Output is correct
12	Correct	1 ms	2384 KB	Output is correct
13	Correct	1 ms	2616 KB	Output is correct
14	Correct	1 ms	2548 KB	Output is correct
15	Correct	1 ms	2384 KB	Output is correct
16	Correct	1 ms	2552 KB	Output is correct
17	Correct	1 ms	2384 KB	Output is correct
18	Correct	1 ms	2384 KB	Output is correct
19	Correct	1 ms	2384 KB	Output is correct
20	Correct	1 ms	2384 KB	Output is correct
21	Correct	1 ms	2384 KB	Output is correct
22	Correct	1 ms	2384 KB	Output is correct
23	Correct	1 ms	2384 KB	Output is correct
24	Correct	1 ms	2384 KB	Output is correct
25	Correct	1 ms	2384 KB	Output is correct
26	Correct	1 ms	2384 KB	Output is correct

Subtask #3
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2384 KB	Output is correct
2	Correct	1 ms	2384 KB	Output is correct
3	Correct	1 ms	2384 KB	Output is correct
4	Correct	1 ms	2384 KB	Output is correct
5	Correct	1 ms	2384 KB	Output is correct
6	Correct	1 ms	2384 KB	Output is correct
7	Correct	1 ms	2384 KB	Output is correct
8	Correct	1 ms	2384 KB	Output is correct
9	Correct	1 ms	2384 KB	Output is correct
10	Correct	1 ms	2384 KB	Output is correct
11	Correct	1 ms	2384 KB	Output is correct
12	Correct	1 ms	2384 KB	Output is correct
13	Correct	1 ms	2616 KB	Output is correct
14	Correct	1 ms	2548 KB	Output is correct
15	Correct	1 ms	2384 KB	Output is correct
16	Correct	1 ms	2552 KB	Output is correct
17	Correct	1 ms	2384 KB	Output is correct
18	Correct	1 ms	2384 KB	Output is correct
19	Correct	1 ms	2384 KB	Output is correct
20	Correct	1 ms	2384 KB	Output is correct
21	Correct	1 ms	2384 KB	Output is correct
22	Correct	1 ms	2384 KB	Output is correct
23	Correct	1 ms	2384 KB	Output is correct
24	Correct	1 ms	2384 KB	Output is correct
25	Correct	1 ms	2384 KB	Output is correct
26	Correct	1 ms	2384 KB	Output is correct
27	Correct	3 ms	2640 KB	Output is correct
28	Correct	2 ms	2640 KB	Output is correct
29	Correct	3 ms	2640 KB	Output is correct
30	Correct	2 ms	2640 KB	Output is correct
31	Correct	2 ms	2624 KB	Output is correct
32	Correct	2 ms	2640 KB	Output is correct
33	Correct	2 ms	2640 KB	Output is correct
34	Correct	2 ms	2640 KB	Output is correct
35	Correct	3 ms	2640 KB	Output is correct
36	Correct	4 ms	2640 KB	Output is correct
37	Correct	2 ms	2596 KB	Output is correct
38	Correct	2 ms	2808 KB	Output is correct
39	Correct	2 ms	2572 KB	Output is correct
40	Correct	2 ms	2640 KB	Output is correct
41	Correct	2 ms	2640 KB	Output is correct
42	Correct	2 ms	2640 KB	Output is correct
43	Correct	2 ms	2640 KB	Output is correct
44	Correct	2 ms	2640 KB	Output is correct
45	Correct	2 ms	2640 KB	Output is correct
46	Correct	2 ms	2640 KB	Output is correct
47	Correct	2 ms	2640 KB	Output is correct
48	Correct	2 ms	2640 KB	Output is correct
49	Correct	2 ms	2640 KB	Output is correct
50	Correct	3 ms	2872 KB	Output is correct
51	Correct	3 ms	2640 KB	Output is correct

Subtask #4
50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2384 KB	Output is correct
2	Correct	1 ms	2384 KB	Output is correct
3	Correct	1 ms	2384 KB	Output is correct
4	Correct	1 ms	2384 KB	Output is correct
5	Correct	1 ms	2384 KB	Output is correct
6	Correct	1 ms	2384 KB	Output is correct
7	Correct	1 ms	2384 KB	Output is correct
8	Correct	1 ms	2384 KB	Output is correct
9	Correct	1 ms	2384 KB	Output is correct
10	Correct	1 ms	2384 KB	Output is correct
11	Correct	1 ms	2384 KB	Output is correct
12	Correct	1 ms	2384 KB	Output is correct
13	Correct	1 ms	2616 KB	Output is correct
14	Correct	1 ms	2548 KB	Output is correct
15	Correct	1 ms	2384 KB	Output is correct
16	Correct	1 ms	2552 KB	Output is correct
17	Correct	1 ms	2384 KB	Output is correct
18	Correct	1 ms	2384 KB	Output is correct
19	Correct	1 ms	2384 KB	Output is correct
20	Correct	1 ms	2384 KB	Output is correct
21	Correct	1 ms	2384 KB	Output is correct
22	Correct	1 ms	2384 KB	Output is correct
23	Correct	1 ms	2384 KB	Output is correct
24	Correct	1 ms	2384 KB	Output is correct
25	Correct	1 ms	2384 KB	Output is correct
26	Correct	1 ms	2384 KB	Output is correct
27	Correct	3 ms	2640 KB	Output is correct
28	Correct	2 ms	2640 KB	Output is correct
29	Correct	3 ms	2640 KB	Output is correct
30	Correct	2 ms	2640 KB	Output is correct
31	Correct	2 ms	2624 KB	Output is correct
32	Correct	2 ms	2640 KB	Output is correct
33	Correct	2 ms	2640 KB	Output is correct
34	Correct	2 ms	2640 KB	Output is correct
35	Correct	3 ms	2640 KB	Output is correct
36	Correct	4 ms	2640 KB	Output is correct
37	Correct	2 ms	2596 KB	Output is correct
38	Correct	2 ms	2808 KB	Output is correct
39	Correct	2 ms	2572 KB	Output is correct
40	Correct	2 ms	2640 KB	Output is correct
41	Correct	2 ms	2640 KB	Output is correct
42	Correct	2 ms	2640 KB	Output is correct
43	Correct	2 ms	2640 KB	Output is correct
44	Correct	2 ms	2640 KB	Output is correct
45	Correct	2 ms	2640 KB	Output is correct
46	Correct	2 ms	2640 KB	Output is correct
47	Correct	2 ms	2640 KB	Output is correct
48	Correct	2 ms	2640 KB	Output is correct
49	Correct	2 ms	2640 KB	Output is correct
50	Correct	3 ms	2872 KB	Output is correct
51	Correct	3 ms	2640 KB	Output is correct
52	Correct	137 ms	18436 KB	Output is correct
53	Correct	134 ms	18428 KB	Output is correct
54	Correct	132 ms	18368 KB	Output is correct
55	Correct	132 ms	18376 KB	Output is correct
56	Correct	126 ms	18432 KB	Output is correct
57	Correct	116 ms	18368 KB	Output is correct
58	Correct	125 ms	18440 KB	Output is correct
59	Correct	118 ms	18372 KB	Output is correct
60	Correct	114 ms	18368 KB	Output is correct
61	Correct	116 ms	18432 KB	Output is correct
62	Correct	122 ms	18368 KB	Output is correct
63	Correct	136 ms	18424 KB	Output is correct
64	Correct	127 ms	18368 KB	Output is correct
65	Correct	116 ms	18432 KB	Output is correct
66	Correct	128 ms	18436 KB	Output is correct
67	Correct	119 ms	18436 KB	Output is correct
68	Correct	118 ms	18368 KB	Output is correct

Submission #1108379

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