Submission #77101

#TimeUsernameProblemLanguageResultExecution timeMemory
77101MohamedAhmed0Art Exhibition (JOI18_art)C++14
0 / 100
2 ms256 KiB
#include <bits/stdc++.h> using namespace std; long long n ; vector< pair<long long , long long> >vp ; int main() { cin>>n ; for(long long i = 0 ; i < n ; ++i) { long long x , y ; cin>>x>>y ; vp.push_back({x , y}); } sort(vp.begin() , vp.end()); long long ans = 0 ; for(long long i = 0 ; i < n ; ++i) { long long MAX = vp[i].first , MIN = vp[i].first , sum = vp[i].second ; for(long long j = i+1 ; j < n ; ++j) { MAX = max(MAX , vp[j].first * 1ll); MIN = min(MIN , vp[j].first * 1ll); sum += vp[j].second * 1ll; ans = max(ans , sum - MAX + MIN) * 1ll; } } return cout<<ans , 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...