| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1229139 | dinhhiep | Art Exhibition (JOI18_art) | C++20 | 0 ms | 320 KiB |
#include<bits/stdc++.h>
using namespace std;
const long long N=1e5+5;
pair<int,int>a[N];
int pr[N];
int res,maxx;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
for(int i = 1; i <= n; i++){
cin >> a[i].first >> a[i].second;
}
sort(a + 1,a + n + 1);
for(int i=1;i<=n;i++){
pr[i]=pr[i-1] + a[i].second;
maxx=max(maxx,a[i].first - pr[i-1]);
res=max(res,pr[i] + maxx - a[i].first);
}
cout << res;
}
| # | 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... | ||||
