#include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
int main() {
  int n, a, b;
  cin >> n >> a >> b;
  vector<int> cap(n);
  long long int sum = 0;
  for (int i = 0; i < n; i++) {
    cin >> cap[i];
    sum += cap[i];
  }
  sort(cap.begin() + 1, cap.end());
  float first = cap[0];
  float fcap = (float)first * a / sum;
  if (fcap >= b) {
    cout << 0;
    return 0;
  } else {
    float fcap = (float)cap[0] * a / sum;
    int res = 0;
    for (int i = n - 1; i >= 0; i--) {
      if (first * a / (sum) >= b) {
        break;
      } else {
        sum -= cap[i];
        res++;
      }
    }
    cout << res;
  }
}
