Advertisement
7oSkaaa

H

Jun 30th, 2022
982
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
  1. #include <bits/stdc++.h>
  2.  
  3. using namespace std;
  4.  
  5. #define cin_2d(vec, n, m) for(int i = 0; i < n; i++) for(int j = 0; j < m && cin >> vec[i][j]; j++);
  6. #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++);
  7. #define cout_map(mp) for(auto& [f, s] : mp) cout << f << "  " << s << "\n";
  8. #define Time cerr << "Time Taken: " << (float)clock() / CLOCKS_PER_SEC << " Secs" << "\n";
  9. #define fixed(n) fixed << setprecision(n)
  10. #define ceil(n, m) (((n) / (m)) + ((n) % (m) ? 1 : 0))
  11. #define fill(vec, value) memset(vec, value, sizeof(vec));
  12. #define Num_of_Digits(n) ((int)log10(n) + 1)
  13. #define mod_combine(a, b, m) (((a % m) * (b % m)) % m)
  14. #define all(vec) vec.begin(), vec.end()
  15. #define rall(vec) vec.rbegin(), vec.rend()
  16. #define sz(x) int(x.size())
  17. #define debug(x) cout << #x << ": " << (x) << "\n";
  18. #define fi first
  19. #define se second
  20. #define ll long long
  21. #define ull unsigned long long
  22. #define Mod  1'000'000'007
  23. #define OO 2'000'000'000
  24. #define EPS 1e-9
  25. #define PI acos(-1)
  26. template < typename T = int > using Pair = pair < T, T >;
  27.  
  28. template < typename T = int > istream& operator >> (istream &in, vector < T > &v) {
  29.     for (auto &x: v) in >> x;
  30.     return in;
  31. }
  32.  
  33. template < typename T = int > ostream& operator << (ostream &out, const vector < T > &v) {
  34.     for (const T &x: v) out << x << ' ';
  35.     return out;
  36. }
  37.  
  38. void AhMeD_HoSSaM(){
  39.     ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
  40.     // #ifndef ONLINE_JUDGE
  41.     //     freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
  42.     // #endif
  43. }
  44.  
  45. struct Data {
  46.    
  47.     ll x, y;
  48.  
  49.     Data(ll X = 0, ll Y = 0) : x(X), y(Y) {}
  50.  
  51.     bool operator < (const Data &other) const {
  52.         return (y - x) > (other.y - other.x);
  53.     }
  54.  
  55. };
  56.  
  57. void Solve(){
  58.     int n, k;
  59.     cin >> n >> k;
  60.     vector < Data > v(n);
  61.     for(auto& [x, y] : v)
  62.         cin >> x >> y;
  63.     sort(all(v), [&](const Data& a, const Data& b){
  64.         return a.x < b.x || (a.x == b.x && a.y > b.y);
  65.     });
  66.     multiset < Data > mst;
  67.     mst.insert(v.front());
  68.     ll best_ans = -1, l = 0, r = 1;
  69.     while(r < n){
  70.         while(l < r && v[r].x - v[l].x > k)
  71.             mst.erase(mst.find(v[l++]));
  72.         if(mst.empty()){
  73.             mst.insert(v[r++]);
  74.             continue;
  75.         }
  76.         Data top = *mst.begin();
  77.         best_ans = max(best_ans, top.y + v[r].y + v[r].x - top.x);
  78.         mst.insert(v[r++]);
  79.     }
  80.     cout << best_ans << "\n";
  81. }
  82.  
  83. int main(){
  84.     AhMeD_HoSSaM();
  85.     int t = 1;
  86.     //cin >> t;
  87.     while(t--)
  88.         Solve();
  89.     return 0;
  90. }
Advertisement
RAW Paste Data Copied
Advertisement