제출 #765155

#제출 시각아이디문제언어결과실행 시간메모리
765155IsaLArt Exhibition (JOI18_art)C++17
100 / 100
146 ms8640 KiB
#include<bits/stdc++.h> using namespace std; #define fi first #define se second #define pii pair<int,int> #define pll pair<long long, long long> int tc; long long n; pll arr[500069]; int main() { ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0); long long i; cin>>n; for(i=1;i<=n;i++) { cin>>arr[i].fi>>arr[i].se; } sort(arr+1,arr+n+1); // 1 <= j <= i <= n // cost(j,i) = a[i] - a[j] + pref[i] - pref[j-1] // = a[i] + pref[i] - (a[j] + pref[j-1]) long long ans = 0, mn = 1e18, sm = 0; for(i=1;i<=n;i++) { mn = min(mn, sm-arr[i].fi); sm += arr[i].se; ans = max(ans, sm-arr[i].fi-mn); } 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...