#include <bits/stdc++.h>
using namespace std;
int x[100004];
int main() {
  int n, i, a, c;
  double k, b;
  long long gumar = 0;
  cin >> n >> a >> b;
  cin >> c;
  if (b == a)
    cout << n - 1 << endl;
  else {
    for (i = 0; i < n - 1; ++i) {
      cin >> x[i];
      gumar += x[i];
    }
    sort(x, x + n - 1);
    k = (a * c) / (gumar + c);
    if (k >= b)
      cout << "0" << endl;
    else {
      for (i = n - 2; i >= 0; --i) {
        gumar -= x[i];
        k = (a * c) / (gumar + c);
        if (k >= b) break;
      }
      cout << n - i - 1 << endl;
    }
  }
  return 0;
}
