Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- #define cin_2d(vec, n, m) for(int i = 0; i < n; i++) for(int j = 0; j < m && cin >> vec[i][j]; j++);
- #define cout_2d(vec, n, m) for(int i = 0; i < n; i++, cout << "\n") for(int j = 0; j < m && cout << vec[i][j] << " "; j++);
- #define cout_map(mp) for(auto& [f, s] : mp) cout << f << " " << s << "\n";
- #define Time cerr << "Time Taken: " << (float)clock() / CLOCKS_PER_SEC << " Secs" << "\n";
- #define fixed(n) fixed << setprecision(n)
- #define ceil(n, m) (((n) / (m)) + ((n) % (m) ? 1 : 0))
- #define fill(vec, value) memset(vec, value, sizeof(vec));
- #define Num_of_Digits(n) ((int)log10(n) + 1)
- #define mod_combine(a, b, m) (((a % m) * (b % m)) % m)
- #define all(vec) vec.begin(), vec.end()
- #define rall(vec) vec.rbegin(), vec.rend()
- #define sz(x) int(x.size())
- #define debug(x) cout << #x << ": " << (x) << "\n";
- #define fi first
- #define se second
- #define ll long long
- #define ull unsigned long long
- #define Mod 1'000'000'007
- #define OO 2'000'000'000
- #define EPS 1e-9
- #define PI acos(-1)
- template < typename T = int > using Pair = pair < T, T >;
- template < typename T = int > istream& operator >> (istream &in, vector < T > &v) {
- for (auto &x: v) in >> x;
- return in;
- }
- template < typename T = int > ostream& operator << (ostream &out, const vector < T > &v) {
- for (const T &x: v) out << x << ' ';
- return out;
- }
- void AhMeD_HoSSaM(){
- ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
- // #ifndef ONLINE_JUDGE
- // freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
- // #endif
- }
- struct Data {
- ll x, y;
- Data(ll X = 0, ll Y = 0) : x(X), y(Y) {}
- bool operator < (const Data &other) const {
- return (y - x) > (other.y - other.x);
- }
- };
- void Solve(){
- int n, k;
- cin >> n >> k;
- vector < Data > v(n);
- for(auto& [x, y] : v)
- cin >> x >> y;
- sort(all(v), [&](const Data& a, const Data& b){
- return a.x < b.x || (a.x == b.x && a.y > b.y);
- });
- multiset < Data > mst;
- mst.insert(v.front());
- ll best_ans = -1, l = 0, r = 1;
- while(r < n){
- while(l < r && v[r].x - v[l].x > k)
- mst.erase(mst.find(v[l++]));
- if(mst.empty()){
- mst.insert(v[r++]);
- continue;
- }
- Data top = *mst.begin();
- best_ans = max(best_ans, top.y + v[r].y + v[r].x - top.x);
- mst.insert(v[r++]);
- }
- cout << best_ans << "\n";
- }
- int main(){
- AhMeD_HoSSaM();
- int t = 1;
- //cin >> t;
- while(t--)
- Solve();
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement