#include <bits/stdc++.h>
using namespace std;
using lli = long long;
using ld = long double;
mt19937 rnd(time(nullptr));
inline void Solve() {
  lli n = 0, a = 0, b = 0;
  cin >> n >> a >> b;
  vector<lli> data(n - 1);
  lli first = 0;
  cin >> first;
  lli sum = first;
  for (auto &it : data) {
    cin >> it;
    sum += it;
  }
  sort(data.rbegin(), data.rend());
  if (first * a >= sum * b) {
    cout << 0;
    return;
  }
  for (lli i = 0; i < data.size(); i++) {
    sum -= data[i];
    if (first * a >= sum * b) {
      cout << i + 1;
      return;
    }
  }
}
signed main() {
  cout << fixed << setprecision(20);
  Solve();
  return 0;
}
