题解 | 破壁

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

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	
	int n,x,y;
	cin>>n>>x>>y;
	vector<int> vt(n+10,0);
	vector<int> mi_x;
	for(int i=1;i<=n;i++){
		cin>>vt[i];
		if(x>=vt[i]){
			mi_x.push_back(x);
		}
	} 
	if(x>y){
		cout<<n<<endl;
		return 0;
	}else if(x<=y){
		if(mi_x.size()%2==1){
			cout<<mi_x.size()/2+1<<endl;
		}else{
			cout<<mi_x.size()/2<<endl;
		}
	}
	

    return 0;
}