| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1319267 | nathako9n | Art Exhibition (JOI18_art) | C++20 | 126 ms | 8248 KiB |
#include <bits/stdc++.h>
#define ll long long
#define endl '\n'
using namespace std;
const int N = 500005;
pair<ll,ll>ar[N+3];
int n;
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cin>>n;
for(int i=1;i<=n;i++){
ll x,y;cin>>x>>y;
ar[i]={x,y};
}
sort(ar+1,ar+n+1);
for(int i=1;i<=n;i++){
ar[i].second+=ar[i-1].second;
}
ll mx=-1e15,ans=-1e15;
for(int i=n;i>=1;i--){
mx=max(mx,ar[i].second-ar[i].first);
ans=max(ans,mx-ar[i-1].second+ar[i].first);
}
cout<<ans;
}
/*
3
2 3
11 2
4 5
*/
| # | 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... | ||||
