| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1290548 | topraksenn | Art Exhibition (JOI18_art) | C++20 | 414 ms | 12156 KiB |
#include <bits/stdc++.h>
#define int long long
using namespace std;
int32_t main(){
int n;
cin >> n;
vector<pair<int,int>> a(n);
for(int i=0;i<n;i++){
cin>>a[i].first>>a[i].second;
}
if(n==1){
cout<<a[0].second<<endl;
return 0;
}
sort(a.begin(),a.end());
vector<int>p(n+1,0);
for(int i=0;i<n;i++){
p[i+1]=p[i]+a[i].second;
}
int r=a[0].second;
int maxx=a[0].first-p[0];
for(int i=1;i<n;i++){
r=max(r,p[i+1]-a[i].first+maxx);
r=max(r,a[i].second);
maxx=max(maxx,a[i].first-p[i]);
}
cout<<r<<endl;
return 0;
}| # | 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... | ||||
