This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define OYY 100000000000005
#define mod 1000000007
#define faster ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define FOR for(int i=1;i<=n;i++)
#define mid (start+end)/2
#define lim 300005
#define fi first
#define se second
vector<pair<int,int>> dizi;
int n;
int32_t main(){
faster
cin>>n;
dizi.push_back({0,0});
FOR{
int x,y;cin>>x>>y;
dizi.push_back({x,y});
}
sort(dizi.begin(),dizi.end());
int mini_bir=LLONG_MAX,cev=-LLONG_MAX,sum=0;
FOR{
sum+=dizi[i].se;
mini_bir=min(mini_bir,dizi[i].fi);
//cout<<sum<<" "<<mini_bir<<" "<<cev<<" "<<sum-(dizi[i].fi-mini_bir)<<endl;
if(sum-(dizi[i].fi-mini_bir)>=0){
cev=max(cev,sum-(dizi[i].fi-mini_bir));
}
else{
sum=0;
mini_bir=LLONG_MAX;
}
cev=max(cev,sum-(dizi[i].fi-mini_bir));
}
cout<<cev<<'\n';
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... |