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>
using namespace std;
struct pos
{
long long s, val;
bool operator<(pos b) const
{
return s < b.s;
}
};
long long n,ans;
pos v[500005];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cin>>n;
for(int i=1;i<=n;i++)
cin>>v[i].s>>v[i].val;
sort(v+1, v+n+1);
multiset<long long> s;
long long sum=0;
for(int i=1;i<=n;i++)
{
sum += v[i-1].val;
s.insert(sum - v[i].s);
ans = max(ans, sum+v[i].val - v[i].s - *s.begin());
}
cout<<ans;
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... |