| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1340881 | jenterjongle45 | Art Exhibition (JOI18_art) | C++20 | 432 ms | 12156 KiB |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll,ll>;
int main(){
int n;cin>>n;
ll ans=0,mx=0;
vector<pll> a(n);
vector<ll> qs(n);
for(auto &x:a){
cin>>x.first>>x.second;
}
sort(a.begin(),a.end());
qs[0]=a[0].second;
for(int i=1;i<n;i++) qs[i]=qs[i-1]+a[i].second;
ans=a[0].second;
mx=a[0].first;
for(int i=1;i<n;i++){
mx=max(mx,a[i].first-qs[i-1]);
ans=max(ans,qs[i]+mx-a[i].first);
}
cout<<ans;
}| # | 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... | ||||
