Submission #1216516

#TimeUsernameProblemLanguageResultExecution timeMemory
1216516gabyferaqArt Exhibition (JOI18_art)C++20
100 / 100
764 ms8244 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 sa=0,maxi=art[0].second,ini=0,xd,mex; for(int i=0;i<n;i++) { sa+=art[i].second; xd=(art[i].second-(art[i].first-art[i].first)); mex=max(((sa)-(art[i].first-art[ini].first)),xd); if(mex==xd) sa=art[i].second,ini=i; maxi=max(maxi,mex); } 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...