// Balgabaev Mansur
#include <bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
#define pb push_back
#define int long long
using namespace std;
const int N=1e6+7;
const int MOD=1e9+7;
const int INF=1e18;
int binpow (int a, int n) {
if (n == 0)
return 1;
if (n % 2 == 1)
return binpow (a, n-1) * a;
else {
int b = binpow (a, n/2);
return b * b;
}
}
pair<int,int>p[N];
void solve(){
int n;
cin >> n;
for(int i = 1 ; i <= n ; i++){
cin >> p[i].first >> p[i].second;
}
int ans=-INF;
sort(p+1,p+1+n);
int sm=0;
for(int i = 1 ; i <= n ; i++){
sm+=p[i].second;
ans=max(ans,sm-(p[i].first-p[1].first));
}
cout << ans;
}
signed main() {
// freopen("closing.in", "r", stdin);
// freopen("closing.out", "w", stdout);
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int test = 1,cntx=1;
//cin >> test;
while (test--) {
//cout << "Case " << cntx << ':' << '\n';
solve();
cntx++;
}
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
