#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define file(s) freopen(s".in", "r", stdin);freopen(s".out", "w", stdout);
#define nano chrono::steady_clock::now().time_since_epoch().count()
#define uid uniform_int_distribution<int>
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define pb push_back
#define sz() size()
#define ft first
#define sd second
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef unsigned long long ull;
const int N = 1e6 + 10;
const int M = 1e7 + 5;
const ll inf = 1e15;
ll mod = 1e9 + 7;
const double Pi = acos(-1);
ll binpow(ll x, ll ti) { ll res = 1;while (ti){if(ti & 1)res *= x;x *= x;ti >>= 1; x %= mod; res %= mod;} return res;}
ll binmul(ll x, ll ti) { ll res = 0;while (ti){if(ti & 1)res += x;x += x;ti >>= 1; x %= mod; res %= mod;} return res;}
ll random(ll l, ll r) { mt19937 rnd(nano); uid dist(l, r); return dist(rnd); }
ll nok(ll a, ll b) { return (a*b)/__gcd(abs(a),abs(b)) * (a*b > 0 ? 1 : -1); }
bool odd(ll n) { return (n % 2 == 1); }
bool even(ll n) { return (n % 2 == 0); }
ll n, pr[N];
pll a[N];
ll f(ll x) {
ll res = -inf;
for (int i = 1; i <= n; ++ i) {
ll l = i, r = n, j = -1;
while (l <= r) {
ll mid = (l + r) / 2;
if (a[mid].ft <= a[i].ft + x - 1) l = mid + 1, j = mid;
else r = mid - 1;
}
res = max(res, pr[j] - pr[i - 1]);
}
return (res - x + 1);
}
const void solve(/*Armashka*/) {
cin >> n;
for (int i = 1; i <= n; ++ i) cin >> a[i].ft >> a[i].sd;
sort(a + 1, a + n + 1);
for (int i = 1; i <= n; ++ i) pr[i] = pr[i - 1] + a[i].sd;
ll l = 1, r = 1e15;
for (int i = 1; i <= 300; ++ i) {
ll m1 = l + (r - l) / 3, m2 = r - (r - l) / 3;
if (f(m1) > f(m2)) r = m2;
else l = m1;
}
ll ans = -inf;
for (ll i = l; i <= r; ++ i) ans = max(ans, f(i));
cout << ans;
}
signed main() {
srand(time(NULL));
// fast;
// file("");
int tt = 1;
// cin >> tt;
for (int i = 1; i <= tt; ++ i) {
solve();
}
}
// Jelbiretip kok tudy, boys in the hood
// Kim qandai juz, kimde qandai ru
Compilation message
art.cpp:5: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
5 | #pragma comment(linker, "/stack:200000000")
|
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
