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>
#include <iostream>
#include<queue>
#include<vector>
#include<utility>
using namespace std;
typedef long long ll;
const int sz=101;
const int sz1=5e5+1;
int n,x,k,i,j,w,m;
ll res=1e18;
ll ans=0;
int movex[4]={0,0,1,-1};
int movey[4]={-1,1,0,0};
long long c[sz1];
vector<ll>adj[sz];
long long pf[sz1];
long long dp[sz1];
vector<pair<long long,int>>pic;
int main(){
cin>>n;
pic.push_back({0,0});
for(int i = 0; i < n; i++){
long long u,v ;cin>>u>>v;
pic.push_back({u,v});
}
sort(pic.begin(),pic.end());
long long sum = 0;
long long ans = 0;
long long mn = LLONG_MAX;
for( int i = 1 ; i <= n; i++){
mn = min(mn, sum - pic[i].first);
sum += pic[i].second;
ans = max(ans, sum - mn - pic[i].first);
}
cout<<ans<<endl;
}
# | 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... |