Submission #63336

#TimeUsernameProblemLanguageResultExecution timeMemory
63336chunghanArt Exhibition (JOI18_art)C++14
50 / 100
1078 ms12504 KiB
#include<iostream> #include<memory.h> #include<utility> #include<algorithm> #include<vector> using namespace std; typedef long long int lld; lld n, s[500001] = {0, }, a, b, tmp; vector<pair<lld, lld>> art; int main() { ios::sync_with_stdio(0); cin.tie(0); cin >> n; art.push_back(pair<lld, lld>(0, 0)); for(int i = 0; i < n; i++) { cin >> a >> b; art.push_back(pair<lld, lld>(a, b)); } sort(art.begin(), art.end()); for(int i = 1; i <= n; i++) { s[i] = s[i-1] + get<1>(art[i]); } lld tmp = 0; for(int i = 1; i <= n; i++) { for(int j = i; j <= n; j++) { tmp = max(tmp,s[j]-s[i-1]-(get<0>(art[j])-get<0>(art[i]))); } } cout << tmp; 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...