| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1281580 | deh | Art Exhibition (JOI18_art) | C++20 | 132 ms | 12108 KiB |
#include <bits/stdc++.h>
#define ll long long
#define f first
#define s second
const ll mod = 1000000007;
using namespace std;
ll pre[500005],n;
pair<ll,ll>a[500005];
void solve(){
cin >> n;
for(int i = 1;i <= n;i++)cin >> a[i].f >> a[i].s;
sort(a+1,a+n+1);
for(int i = 1;i <= n;i++){
pre[i] = pre[i-1] + max(a[i].s,1LL*0);
}
ll cur = -1e18,res = -1e18;
for(int i = 1;i <= n;i++){
cur = max(cur,a[i].f-pre[i-1]);
res = max(res,pre[i]-a[i].f+cur);
}
cout << res;
}
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
if(fopen("deH.INP","r")){
freopen("deH.INP","r",stdin);
freopen("deH.OUT","w",stdout);
}
int ts = 1;//cin >> ts;
while(ts--)solve();
return 0;
}
컴파일 시 표준 에러 (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... | ||||
