oj.uz

Submission #328210

# Submission time Handle Problem Language Result Execution time Memory
328210 2020-11-15T19:04:56 Z MilosMilutinovic Art Exhibition (JOI18_art) C++14
100 / 100
 338 ms 48392 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
    int n;
    scanf("%i",&n);
    vector<pair<ll,ll>> v(n);
    for(int i=0;i<n;i++)scanf("%lld %lld",&v[i].first,&v[i].second);
    sort(v.begin(),v.end());
    ll pref[n];
    for(int i=0;i<n;i++){
        if(i==0)pref[i]=v[i].second;
        else pref[i]=pref[i-1]+v[i].second;
    }
    set<ll> s;
    ll ans=0;
    for(int i=n-1;i>=0;i--){
        s.insert(pref[i]-v[i].first);
        ll x=0;
        if(i>0)x=pref[i-1];
        ans=max(ans,*prev(s.end())-x+v[i].first);
    }
    printf("%lld",ans);
    return 0;
}

Compilation message

art.cpp: In function 'int main()':
art.cpp:6:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    6 |     scanf("%i",&n);
      |     ~~~~~^~~~~~~~~
art.cpp:8:30: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    8 |     for(int i=0;i<n;i++)scanf("%lld %lld",&v[i].first,&v[i].second);
      |                         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 3 ms 748 KB Output is correct
28 Correct 3 ms 748 KB Output is correct
29 Correct 4 ms 748 KB Output is correct
30 Correct 4 ms 748 KB Output is correct
31 Correct 3 ms 748 KB Output is correct
32 Correct 3 ms 748 KB Output is correct
33 Correct 3 ms 748 KB Output is correct
34 Correct 3 ms 748 KB Output is correct
35 Correct 3 ms 748 KB Output is correct
36 Correct 3 ms 748 KB Output is correct
37 Correct 3 ms 748 KB Output is correct
38 Correct 3 ms 748 KB Output is correct
39 Correct 3 ms 748 KB Output is correct
40 Correct 3 ms 748 KB Output is correct
41 Correct 3 ms 748 KB Output is correct
42 Correct 3 ms 748 KB Output is correct
43 Correct 4 ms 748 KB Output is correct
44 Correct 3 ms 748 KB Output is correct
45 Correct 3 ms 748 KB Output is correct
46 Correct 3 ms 748 KB Output is correct
47 Correct 3 ms 748 KB Output is correct
48 Correct 3 ms 748 KB Output is correct
49 Correct 3 ms 748 KB Output is correct
50 Correct 3 ms 748 KB Output is correct
51 Correct 3 ms 748 KB Output is correct
52 Correct 281 ms 48108 KB Output is correct
53 Correct 286 ms 48256 KB Output is correct
54 Correct 294 ms 48236 KB Output is correct
55 Correct 308 ms 48236 KB Output is correct
56 Correct 338 ms 48236 KB Output is correct
57 Correct 332 ms 48236 KB Output is correct
58 Correct 312 ms 48364 KB Output is correct
59 Correct 309 ms 48364 KB Output is correct
60 Correct 304 ms 48236 KB Output is correct
61 Correct 307 ms 48108 KB Output is correct
62 Correct 303 ms 48392 KB Output is correct
63 Correct 299 ms 48364 KB Output is correct
64 Correct 291 ms 48236 KB Output is correct
65 Correct 281 ms 48380 KB Output is correct
66 Correct 275 ms 48236 KB Output is correct
67 Correct 290 ms 48364 KB Output is correct
68 Correct 319 ms 48364 KB Output is correct