# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
159881 | dantoh000 | Art Exhibition (JOI18_art) | C++14 | 337 ms | 21112 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define int long long
using namespace std;
typedef pair<int,int> ii;
main(){
int n;
scanf("%lld",&n);
ii a[n];
for (int i = 0; i < n; i++){
scanf("%lld%lld",&a[i].first,&a[i].second);
}
sort(a,a+n);
int m = -a[0].first;
int cur = 0;
int ans = 0;
for (int i = 0; i < n; i++){
cur += a[i].second;
//printf("%d %d %d -> ",cur,m,a[i].first);
//printf("%d ",cur-m-a[i].first);
ans = max(ans,cur-m-a[i].first);
m = min(m,cur-a[i+1].first);
}
printf("%lld",ans);
}
Compilation message (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... |