#include <bits/stdc++.h>
using namespace std;
int n, a, b, v[100005];
int main() {
  cin >> n >> a >> b;
  int first;
  cin >> first;
  long long sumtot = first;
  for (int i = 1; i < n; ++i) {
    cin >> v[i];
    sumtot += v[i];
  }
  sort(v + 1, v + n + 1, greater<int>());
  int left = 0, right = n - 1, sol = 0;
  while (left <= right) {
    int mid = (left + right) / 2;
    long long sum = 0;
    for (int i = 1; i <= mid; ++i) sum += v[i];
    long long act = sumtot - sum;
    long long coef = (1LL * first) * (1LL * a) / (1LL * (act));
    if (coef >= 1LL * b) {
      sol = mid;
      right = mid - 1;
    } else
      left = mid + 1;
  }
  cout << sol;
  return 0;
}
