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 ll long long
#define f first
#define s second
using namespace std;
const int N = 5e5 + 5;
int n;
pair<ll , ll> p[N];
long long pr[N];
int main (){
ios_base::sync_with_stdio(0); cin.tie(0);
cin >> n;
for(int i = 0; i < n; ++i) cin >> p[i].f >> p[i].s;
sort(p , p + n);
for(int i = n - 1; i >= 0; --i){
pr[i] = pr[i + 1] + p[i].s;
}
long long MN = 1e18;
long long MX = -1e18;
for(int i = n - 2; i >= 0; --i){
MN = min(MN , pr[i + 1] + p[i].f);
MX = max(MX , pr[i] - MN + p[i].f);
}
cout << MX << endl;
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... |