Submission #1034021

#TimeUsernameProblemLanguageResultExecution timeMemory
1034021vjudge1Art Exhibition (JOI18_art)C++17
100 / 100
146 ms25048 KiB
#include<bits/stdc++.h> using namespace std; using ll=long long; using ld=long double; using pear=pair<ll, ll>; #define fi first #define se second #define nl << '\n' #define uk << ' ' int main() { ios::sync_with_stdio(false); cin.tie(nullptr); // freopen(".inp","r",stdin); // freopen(".out","w",stdout); cin.exceptions(cin.failbit); ll n; cin >> n; ll i; vector<pair<ll, ll>> art(n+1); for(i=1; i<=n; i++){ cin >> art[i].fi >> art[i].se; } vector<ll> pre(n+1); sort(art.begin()+1, art.end()); for(i=1; i<=n; i++){ pre[i]=pre[i-1]+art[i].se; } ll maxi=LLONG_MIN, ans=0; for(i=1; i<=n; i++){ maxi=max(maxi, art[i].fi-pre[i-1]); ans=max(ans, pre[i]-art[i].fi+maxi); } cout << ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...