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;
#define int long long
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define pb push_back
#define F first
#define S second
#define endl "\n"
const int INF = 1e9+10;
const int MOD = 1e9+7;
int n;
vector<pair<int, int>> v;
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n;
for(int i = 0; i < n; i++) {
int a, b; cin >> a >> b;
v.pb({a, b});
}
sort(all(v));
vector<int> sum(n+1);
int at = 0;
for(int i = 0; i < n; i++) {
at += v[i].S;
sum[i+1] = at;
}
int resp = 0;
for(int i = 0; i < n; i++) {
for(int j = i; j < n; j++) {
at = (sum[j+1] - sum[i]) - (v[j].F - v[i].F);
resp = max(resp, at);
}
}
cout << resp << 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... |