fork(2) download
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define int long long int
  4. #define double long double
  5. inline int power(int a, int b) {
  6. int x = 1;
  7. while (b) {
  8. if (b & 1) x *= a;
  9. a *= a;
  10. b >>= 1;
  11. }
  12. return x;
  13. }
  14.  
  15.  
  16. const int M = 1000000007;
  17. const int N = 3e5+9;
  18. const int INF = 2e9+1;
  19. const int LINF = 2000000000000000001;
  20.  
  21. //_ ***************************** START Below *******************************
  22.  
  23.  
  24.  
  25. vector<int> a;
  26. void consistency(int n, int k) {
  27.  
  28. int s= 0, e = n-1;
  29. int ans = 0;
  30.  
  31. //* keep in mind s<e (Not s<=e )
  32. while(s<e){
  33. int sum = a[s] + a[e];
  34. if(sum > k){
  35. ans += (e-s);
  36. e--;
  37. }
  38. else{
  39. s++;
  40. }
  41. }
  42.  
  43. cout << ans << endl;
  44.  
  45. }
  46.  
  47.  
  48. void solve() {
  49.  
  50. int n, k;
  51. cin >> n >> k;
  52.  
  53. a.resize(n);
  54.  
  55. for(int i=0; i<n; i++) cin >> a[i];
  56.  
  57. consistency(n, k);
  58.  
  59. }
  60.  
  61.  
  62.  
  63.  
  64.  
  65. int32_t main() {
  66. ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  67.  
  68. int t = 1;
  69. // cin >> t;
  70. while (t--) {
  71. solve();
  72. }
  73.  
  74. return 0;
  75. }
Success #stdin #stdout 0.01s 5268KB
stdin
5 8
1 2 7 9 10 
stdout
8