fork download
copy 
  1. /*
  2. * @Author: hungeazy
  3. * @Date:   2024-06-08 18:44:05
  4. * @Last Modified by:   hungeazy
  5. * @Last Modified time: 2024-06-08 18:51:55
  6. */
  7. #include <bits/stdc++.h>
  8. // #pragma GCC optimize("O3")  
  9. // #pragma GCC optimize("unroll-loops")  
  10. // #pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt")  
  11. using namespace std;
  12. #define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
  13. #define int long long
  14. #define ull unsigned long long
  15. #define sz(x) x.size()
  16. #define sqr(x) (1LL * (x) * (x))
  17. #define all(x) x.begin(), x.end()
  18. #define fill(f,x) memset(f,x,sizeof(f))
  19. #define FOR(i,l,r) for(int i=l;i<=r;i++)
  20. #define FOD(i,r,l) for(int i=r;i>=l;i--)
  21. #define ii pair<int,int>
  22. #define iii pair<int,ii>
  23. #define di pair<ii,ii>
  24. #define vi vector<int>
  25. #define vii vector<ii>
  26. #define mii map<int,int>
  27. #define fi first
  28. #define se second
  29. #define pb push_back
  30. #define MOD 1000000007
  31. #define __lcm(a,b) (1ll * ((a) / __gcd((a), (b))) * (b))
  32. #define YES cout << "YES\n"
  33. #define NO cout << "NO\n"
  34. #define MASK(i) (1LL << (i))
  35. #define c_bit(i) __builtin_popcountll(i)
  36. #define BIT(x,i) ((x) & MASK(i))
  37. #define SET_ON(x,i) ((x) | MASK(i))
  38. #define SET_OFF(x,i) ((x) & ~MASK(i))
  39. #define oo 1e18
  40. #define name "EMISTA"
  41. #define endl '\n'
  42. #define time() cout << "-------------Time:" << 1000.0 * clock() / CLOCKS_PER_SEC << "ms.";
  43. template<typename T> bool maximize(T &res, const T &val) { if (res < val){ res = val; return true; }; return false; }
  44. template<typename T> bool minimize(T &res, const T &val) { if (res > val){ res = val; return true; }; return false; }
  45. const int N = (int)1e6+10;
  46. ii a[N];
  47. int pre[N];
  48.  
  49. signed main()
  50. {
  51.     fast;
  52.     // freopen(name".inp","r",stdin);
  53.     // freopen(name".out","w",stdout);
  54.     int n,k;
  55.     cin >> n >> k;
  56.     FOR(i,1,n) cin >> a[i].fi >> a[i].se;
  57.     sort(a+1,a+n+1);
  58.     FOR(i,1,n) pre[i] = pre[i-1]+a[i].se;
  59.     int ans = 0;
  60.     FOR(i,1,n)
  61.     {
  62.     	int l = i, r = n, pos;
  63.     	while (l <= r)
  64.     	{
  65.     		int mid = (l+r)>>1;
  66.     		if (a[i].fi+2*k >= a[mid].fi) pos = mid, l = mid+1;
  67.     		else r = mid-1;
  68.     	}
  69.     	ans = max(ans,pre[pos]-pre[i-1]);
  70.     }
  71.     cout << ans;
  72.     return 0;
  73. }
  74. // ██░ ██  █    ██  ███▄    █   ▄████
  75. //▓██░ ██▒ ██  ▓██▒ ██ ▀█   █  ██▒ ▀█▒
  76. //▒██▀▀██░▓██  ▒██░▓██  ▀█ ██▒▒██░▄▄▄░
  77. //░▓█ ░██ ▓▓█  ░██░▓██▒  ▐▌██▒░▓█  ██▓
  78. //░▓█▒░██▓▒▒█████▓ ▒██░   ▓██░░▒▓███▀▒
  79. // ▒ ░░▒░▒░▒▓▒ ▒ ▒ ░ ▒░   ▒ ▒  ░▒   ▒
  80. // ▒ ░▒░ ░░░▒░ ░ ░ ░ ░░   ░ ▒░  ░   ░
  81. // ░  ░░ ░ ░░░ ░ ░    ░   ░ ░ ░ ░   ░
  82. // ░  ░  ░   ░              ░       ░
Success #stdin #stdout 0s 5304KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Standard output is empty
https://ideone.com/awALKJ
language:
C++14 (gcc 8.3)
created:
1 day ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!