제출 #729350

#제출 시각아이디문제언어결과실행 시간메모리
729350pccArt Exhibition (JOI18_art)C++14
0 / 100
0 ms212 KiB
#include <bits/stdc++.h> using namespace std; #define ll long long #define pll pair<ll,ll> #define fs first #define sc second void solve(){ ll n; cin>>n; pll arr[n]; for(auto &i:arr){ cin>>i.fs>>i.sc; } sort(arr,arr+n); ll pref[n]; pref[0] = arr[0].sc; for(int i = 1;i<n;i++)pref[i] = pref[i-1]+arr[i].sc; ll ans = pref[0]; ll big = arr[0].fs; for(int i = 1;i<n;i++){ ans = max(ans,big+pref[i]-arr[i].fs); big = max(big,-pref[i-1]+arr[i].fs); } cout<<ans; } int main(){ ios::sync_with_stdio(0);cin.tie(0);cout.tie(0); int t = 1; while(t--)solve(); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...