#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<pair<long long, long long>> bo_de(n);
for (int i=0; i<n; i++){
cin>>bo_de[i].first>>bo_de[i].second;
}
sort(bo_de.begin(),bo_de.end());
vector<long long> toplam(n+1,0);
for (int i=0; i<n; i++){
toplam[i+1]=toplam[i]+bo_de[i].second;
}
long long sonuc=0;
long long best=toplam[0]-bo_de[0].first;
for (int i=1; i<=n; i++) {
sonuc=max(sonuc, toplam[i]-bo_de[i-1].first-best);
if (i<n){
best=min(best, toplam[i]-bo_de[i].first);
}
}
cout<<sonuc;
}
| # | 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... |