# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
136653 | junodeveloper | Art Exhibition (JOI18_art) | C++14 | 274 ms | 24824 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 sz(x) ((int)x.size())
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
int n;
ll s[500010];
pll a[500010];
int main() {
scanf("%d",&n);
int i;
for(i=1;i<=n;i++) {
scanf("%lld%lld",&a[i].fi,&a[i].se);
}
sort(a+1,a+n+1);
for(i=1;i<=n;i++) {
s[i]=s[i-1]+a[i].se;
}
ll mx=-9e18,res=-9e18;
for(i=n;i>=1;i--) {
mx=max(mx,s[i]-a[i].fi);
res=max(res, mx-s[i-1]+a[i].fi);
}
printf("%lld",res);
return 0;
}
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... |