Submission #1216503

#TimeUsernameProblemLanguageResultExecution timeMemory
1216503gabyferaqArt Exhibition (JOI18_art)C++20
0 / 100
0 ms320 KiB
#include<bits/stdc++.h> typedef long long ll; using namespace std; void solve() { ll n; cin>>n; vector<pair<ll,ll>> art(n,pair<ll,ll>()); for(int i=0;i<n;i++) cin>>art[i].first>>art[i].second; sort(art.begin(),art.end()); ll s=art[0].second,sa=0,maxi=art[0].second,aux; for(int i=0;i<n;i++) { aux=maxi,sa+=art[i].second; maxi=max(maxi,((sa)-(art[i].first-art[0].first))); if(aux!=maxi) s+=art[i].second; } cout<<maxi; } int main() { solve(); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...