# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1270969 | nthvn | Art Exhibition (JOI18_art) | C++20 | 129 ms | 19788 KiB |
#include "bits/stdc++.h"
using namespace std;
#define fi first
#define se second
#define pii pair<int,int>
#define ll long long
#define pb(x) push_back(x)
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define pll pair<ll,ll>
const int N = 5e5+5;
int n;
pll a[N];
ll ps[N], f[N], mn[N];
signed main(){
ios_base::sync_with_stdio(NULL);
cin.tie(NULL);
if(fopen("ART.INP", "r")){
freopen("ART.INP", "r", stdin);
freopen("ART.OUT", "w", stdout);
}
cin>>n;
for(int i=1;i<=n;i++) cin>>a[i].fi>>a[i].se;
sort(a+1,a+n+1);
for(int i=1;i<=n;i++) ps[i] = ps[i-1]+ a[i].se;
f[0] = -a[1].fi;
mn[0]= f[0];
for(int i=1;i<n;i++) {
f[i] = ps[i] - a[i+1].fi;
mn[i] = min(mn[i-1], f[i]);
}
ll ans =0;
for(int r=1;r<=n;r++){
ans = max(ans, ps[r]-a[r].fi-mn[r-1]);
}
cout<<ans;
}
컴파일 시 표준 에러 (stderr) 메시지
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |