Codeforces Round #531 (Div. 3) C. Doors Breaking and Repairing(思维)

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

int main()
{
	int n,x,y;
	int pre[100005];
	cin>>n>>x>>y;
	int ans = 0;
	int a = 0;
	for(int i=0;i<n;i++){
		cin>>pre[i];
		// if(pre[i] <= x) ans++;
		if(pre[i] <= x) a++;
	}
	if(x <= y){
		cout<<ceil(a / 2.0)<<endl;
	}
	else{
		cout<<n<<endl;
	}
	return 0;
}