제출 #46488

#제출 시각아이디문제언어결과실행 시간메모리
46488luciocfArt Exhibition (JOI18_art)C++14
50 / 100
137 ms10016 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; const int MAXN = 100010; const ll INF = 1e16+10; pair<ll, ll> num[MAXN]; ll soma[MAXN]; int main(void) { int n; cin >> n; for (int i = 1; i <= n; i++) cin >> num[i].first >> num[i].second; sort(num+1, num+n+1); for (int i = 1; i <= n; i++) soma[i] = soma[i-1]+num[i].second; ll ans = -INF; for (int i = 1; i <= n; i++) { ans = max(ans, num[i].second); for (int j = i-1; j >= 1; j--) ans = max(ans, soma[i]-soma[j-1]-num[i].first+num[j].first); } cout << ans << "\n"; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...