제출 #1049697

#제출 시각아이디문제언어결과실행 시간메모리
1049697vjudge1Art Exhibition (JOI18_art)C++17
0 / 100
0 ms348 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; #define pll pair<ll, ll> #define fi first #define se second #define speed ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int main() { speed; int n; cin >> n; vector<pll> a(n); for(int i = 0; i < n; i++) cin >> a[i].fi >> a[i].se; sort(begin(a), end(a)); ll pref[n+1]{}, ans = LLONG_MIN; for(int i = 0; i < n; i++) { if(!i) pref[i] = a[i].se; else pref[i] = pref[i-1] + a[i].se; } for(int i = 0; i < n; i++) { for(int j = 0; j < i; j++) { ans = max(ans, pref[i] - (j ? pref[j-1] : 0ll) - (a[i].fi - a[j].fi)); } } 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...