# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
50709 | gnoor | Art Exhibition (JOI18_art) | C++17 | 1008 ms | 39812 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 <cstdio>
#include <map>
#include <algorithm>
#include <vector>
using namespace std;
map<long long,long long> mp;
long long sz[500100];
long long val[500100];
int main () {
int n;
scanf("%d",&n);
long long a,b;
for (int i=0;i<n;i++) {
scanf("%lld%lld",&a,&b);
mp[a]+=b;
}
int nn=0;
for (auto &i:mp) {
//printf("%lld %lld\n",i.first,i.second);
sz[nn]=i.first;
val[nn]=i.second;
if (nn) val[nn]+=val[nn-1];
nn++;
}
long long mnn=-sz[0];
long long ans=0;
for (int i=0;i<nn;i++) {
ans=max(ans,val[i]-sz[i]-mnn);
mnn=min(mnn,val[i]-sz[i+1]);
}
printf("%lld\n",ans);
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... |