Submission #441194

# Submission time Handle Problem Language Result Execution time Memory
441194 2021-07-04T14:47:03 Z julian33 Art Exhibition (JOI18_art) C++14
100 / 100
235 ms 28716 KB
#include <bits/stdc++.h>

using namespace std;

#ifdef LOCAL
#define deb(...) logger(#__VA_ARGS__, __VA_ARGS__)
template<typename ...Args>
void logger(string vars, Args&&... values) {
    cerr<<vars<<" = ";
    string delim="";
    (...,(cerr<<delim<<values,delim=", "));
    cerr<<"\n";
}
#else
#define deb(...) logger(#__VA_ARGS__, __VA_ARGS__)
template<typename ...Args>
void logger(string vars, Args&&... values) {}
#endif

#define pb push_back
#define sz(x) (int)(x.size())
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
template<typename T> inline void maxa(T& a,T b){a=max(a,b);}
template<typename T> inline void mina(T& a,T b){a=min(a,b);}


int main(){
    cin.sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    #ifdef LOCAL
        freopen("input.txt","r",stdin);
        freopen("output.txt","w",stdout);
    #endif

    int n; cin>>n;
    vector<pll> art;
    ll sum=0;
    for(int i=0;i<n;i++){
        ll a,b; cin>>a>>b;
        sum+=b;
        art.pb({a,b});
    }
    sort(art.begin(),art.end());
    vector<ll> psa(n+1),pref(n+1);
    for(int i=1;i<=n;i++){
        psa[i]=art[i-1].second+psa[i-1];
    }
    pref[0]=-art[0].first;
    for(int i=1;i<n;i++){
        pref[i]=min(psa[i]-art[i].first,pref[i-1]);
    }
    ll ans=0;
    for(int i=n;i>=1;i--){
        maxa(ans,psa[i]-art[i-1].first-pref[i-1]);
    }
    cout<<ans<<"\n";
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 312 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 312 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 312 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 312 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 312 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 312 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 3 ms 588 KB Output is correct
28 Correct 3 ms 632 KB Output is correct
29 Correct 3 ms 580 KB Output is correct
30 Correct 3 ms 588 KB Output is correct
31 Correct 3 ms 584 KB Output is correct
32 Correct 3 ms 588 KB Output is correct
33 Correct 3 ms 588 KB Output is correct
34 Correct 3 ms 588 KB Output is correct
35 Correct 3 ms 588 KB Output is correct
36 Correct 3 ms 604 KB Output is correct
37 Correct 3 ms 588 KB Output is correct
38 Correct 3 ms 580 KB Output is correct
39 Correct 3 ms 588 KB Output is correct
40 Correct 3 ms 588 KB Output is correct
41 Correct 3 ms 588 KB Output is correct
42 Correct 3 ms 588 KB Output is correct
43 Correct 3 ms 588 KB Output is correct
44 Correct 3 ms 588 KB Output is correct
45 Correct 3 ms 588 KB Output is correct
46 Correct 3 ms 588 KB Output is correct
47 Correct 3 ms 588 KB Output is correct
48 Correct 3 ms 588 KB Output is correct
49 Correct 3 ms 588 KB Output is correct
50 Correct 3 ms 588 KB Output is correct
51 Correct 3 ms 588 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 312 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 312 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 3 ms 588 KB Output is correct
28 Correct 3 ms 632 KB Output is correct
29 Correct 3 ms 580 KB Output is correct
30 Correct 3 ms 588 KB Output is correct
31 Correct 3 ms 584 KB Output is correct
32 Correct 3 ms 588 KB Output is correct
33 Correct 3 ms 588 KB Output is correct
34 Correct 3 ms 588 KB Output is correct
35 Correct 3 ms 588 KB Output is correct
36 Correct 3 ms 604 KB Output is correct
37 Correct 3 ms 588 KB Output is correct
38 Correct 3 ms 580 KB Output is correct
39 Correct 3 ms 588 KB Output is correct
40 Correct 3 ms 588 KB Output is correct
41 Correct 3 ms 588 KB Output is correct
42 Correct 3 ms 588 KB Output is correct
43 Correct 3 ms 588 KB Output is correct
44 Correct 3 ms 588 KB Output is correct
45 Correct 3 ms 588 KB Output is correct
46 Correct 3 ms 588 KB Output is correct
47 Correct 3 ms 588 KB Output is correct
48 Correct 3 ms 588 KB Output is correct
49 Correct 3 ms 588 KB Output is correct
50 Correct 3 ms 588 KB Output is correct
51 Correct 3 ms 588 KB Output is correct
52 Correct 226 ms 28468 KB Output is correct
53 Correct 219 ms 28584 KB Output is correct
54 Correct 224 ms 28632 KB Output is correct
55 Correct 220 ms 28620 KB Output is correct
56 Correct 217 ms 28600 KB Output is correct
57 Correct 229 ms 28612 KB Output is correct
58 Correct 218 ms 28616 KB Output is correct
59 Correct 217 ms 28580 KB Output is correct
60 Correct 223 ms 28636 KB Output is correct
61 Correct 235 ms 28480 KB Output is correct
62 Correct 220 ms 28712 KB Output is correct
63 Correct 221 ms 28596 KB Output is correct
64 Correct 222 ms 28716 KB Output is correct
65 Correct 219 ms 28620 KB Output is correct
66 Correct 222 ms 28508 KB Output is correct
67 Correct 221 ms 28684 KB Output is correct
68 Correct 218 ms 28520 KB Output is correct