#include <bits/stdc++.h>
using namespace std;
long long int n, A, B, s[100240], ps[100240];
bool goodFlow(int nb) {
  long long int sum = 0;
  int end = n - nb;
  for (int i = 0; i < end; i++) {
    sum += s[i];
  }
  long long int lhs = s[0] * A;
  long long int rhs = sum * B;
  return lhs >= rhs;
}
int main() {
  cin >> n >> A >> B;
  ps[0] = 0;
  for (int i = 0; i < n; i++) {
    cin >> s[i];
    ps[i + 1] = ps[i] + s[i];
  }
  if (n > 1) sort(s + 1, s + n);
  if (n == 1 || goodFlow(0)) {
    printf("0\n");
    return 0;
  }
  int lo = 0, hi = n - 1;
  while (lo < hi) {
    int mid = (lo + hi) >> 1;
    if (mid == lo) break;
    if (goodFlow(mid)) {
      hi = mid;
    } else {
      lo = mid;
    }
  }
  cout << hi << endl;
  return 0;
}
