#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, a, b;
  cin >> n >> a >> b;
  long long int s = 0;
  long long int w[n - 1];
  long long int q;
  cin >> q;
  s += q;
  if (n == 1) {
    cout << 0 << endl;
    return 0;
  }
  for (int i = 0; i < n - 1; i++) {
    cin >> w[i];
    s += w[i];
  }
  sort(w, w + n - 1);
  double r = (q * a) / (double)b;
  int c = 0;
  n -= 2;
  while (n >= 0) {
    if (double(s) <= r) {
      cout << c << endl;
      return 0;
    }
    s -= w[n];
    c++;
    n--;
  }
  cout << c << endl;
}
