#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e18;
const long long N = 2e5 + 7;
const int mod = 1e9 + 7;
bool cmp(const pair<long long, long long>& a,
         const pair<long long, long long>& b) {
  return a.first < b.first;
}
void solve() {
  long long n, A, b;
  cin >> n >> A >> b;
  long long a[n];
  long long sum = 0;
  long long blockedholes = 0;
  for (long long i = 0; i < n; i++) {
    cin >> a[i];
    sum += a[i];
  }
  long long s = floor((a[0] * A) / b);
  vector<int> v;
  for (long long i = 1; i < n; i++) {
    v.push_back(a[i]);
  }
  sort(v.begin(), v.end(), greater<int>());
  if (sum <= s) {
    cout << 0 << '\n';
    return;
  }
  long long i = 0;
  while (sum > s and i < v.size()) {
    sum = sum - v[i];
    blockedholes++;
    i++;
  }
  cout << blockedholes << '\n';
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long t = 1;
  while (t--) {
    solve();
  }
}
