Submission #825266

#TimeUsernameProblemLanguageResultExecution timeMemory
825266NhanBeooArt Exhibition (JOI18_art)C++17
50 / 100
1075 ms11964 KiB
#include <bits/stdc++.h> using namespace std; #define int ll #define MAX LLONG_MAX #define st first #define nd second #define endl '\n' #define SZ(x) ((int)x.size()) #define ALL(x) x.begin(), x.end() typedef long long ll; typedef pair< int, int > ii; typedef pair< int, ii > iii; typedef vector< int > vi; typedef vector< ii > vii; typedef vector< iii > viii; typedef vector< vi > vvi; typedef vector< vii > vvii; typedef vector< viii > vviii; signed main(){ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; ii a[n + 1]; for(int i=1; i<=n; i++) cin >> a[i].st >> a[i].nd; sort(a+1, a+1+n); int pre[n + 1]; pre[0] = 0; for(int i=1; i<=n; i++) pre[i] = pre[i-1] + a[i].nd; int ans = INT_MIN; for(int i=1; i<=n; i++) ans = max(ans, a[i].nd); for(int i=1; i<=n; i++){ for(int j=i+1; j<=n; j++){ ans = max(ans, pre[j] - pre[i-1] + a[i].st - a[j].st); } } cout << ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...