Submission #1115251

#TimeUsernameProblemLanguageResultExecution timeMemory
1115251staszic_ojuzArt Exhibition (JOI18_art)C++17
50 / 100
1055 ms8272 KiB
#include <iostream> #include <vector> #include <algorithm> #include <utility> using namespace std; int main(){ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long n; cin>>n; vector<pair<long long, long long>> vect(n); for (long long i=0;i<n;i++) cin>>vect[i].first>>vect[i].second; sort(vect.begin(), vect.end()); long long best=0; for (long long i=0;i<n;i++){ long long sum=0; for (long long j=i;j<n;j++){ sum+=vect[j].second; if (best<sum-vect[j].first+vect[i].first) best=sum-vect[j].first+vect[i].first; } } cout<<best<<'\n'; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...