1090.cpp

// Problem: Ferris Wheel
// Contest: CSES - CSES Problem Set
// URL: https://cses.fi/problemset/task/1090
// Memory Limit: 512 MB
// Time Limit: 1000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

#include <bits/stdc++.h>
using namespace std;

#define int long long int
#define fast ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define all(x) (x).begin(),(x).end()
#define ln cout<<'\n'
#define X first
#define Y second

#define vi vector<int>
#define vvi vector<vi>


void solve()
{
    int n;
    cin >> n;
    int x;
    cin >> x;
    vi p(n);
    for(int i = 0; i < n; i++) {
    	cin >> p[i];
    }
    sort(all(p));
    int c = 0;
    int i = 0, j = n - 1;
    while(i < j) {
    	if (p[i] + p[j] <= x) {
    		c++;
    		i++;
    		j--;
    	}else{
    		j--;
    	}
    }
    cout << n - c;
}


signed main()
{
    fast;
    int t=1;
    //cin >> t;
    while(t--)
    {
        solve();
    }
    return 0;
}