#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
bool check(ll mid,ll x,ll y, vector<ll> v)
{
// cout<<"mid "<<mid<<endl;
ll cnt=0;
// for(ll i=0;i<v.size();i++)
// cout<<v[i]<<" ";
// cout<<endl;
for(ll i=mid;i<v.size();)
{
if(v[i]>x)
{
i++;
}
else
{
v[i]+=y;
cnt++;
}
if(cnt>mid)
return false;
}
return cnt<=mid;
}
int main() {
ll n,x,y;
cin>>n>>x>>y;
vector<ll> v(n);
for(ll i=0;i<n;i++)
cin>>v[i];
sort(v.begin(),v.end());
if(x>y)
{
cout<<n;
return 0;
}
ll ans;
ll l=0,h=n;
while(l<=h)
{
ll mid = (l+h)/2;
if(check(mid,x,y,v))
{
ans=mid;
h = mid-1;
// cout<<"yes"<<endl;
}
else
{
l = mid+1;
// cout<<"No"<<endl;
}
}
cout<<ans;
return 0;
}
779. K-th Symbol in Grammar | 701. Insert into a Binary Search Tree |
429. N-ary Tree Level Order Traversal | 739. Daily Temperatures |
647. Palindromic Substrings | 583. Delete Operation for Two Strings |
518. Coin Change 2 | 516. Longest Palindromic Subsequence |
468. Validate IP Address | 450. Delete Node in a BST |
445. Add Two Numbers II | 442. Find All Duplicates in an Array |
437. Path Sum III | 436. Find Right Interval |
435. Non-overlapping Intervals | 406. Queue Reconstruction by Height |
380. Insert Delete GetRandom O(1) | 332. Reconstruct Itinerary |
368. Largest Divisible Subset | 377. Combination Sum IV |
322. Coin Change | 307. Range Sum Query - Mutable |
287. Find the Duplicate Number | 279. Perfect Squares |
275. H-Index II | 274. H-Index |
260. Single Number III | 240. Search a 2D Matrix II |
238. Product of Array Except Self | 229. Majority Element II |