#include <bits/stdc++.h>
using namespace std;
const int N = 100006;
long long int n, arr[N] = {}, a, b;
deque<long long int> v;
int main() {
  ios::sync_with_stdio(0), ios_base::sync_with_stdio(0), cin.tie(0),
      cout.tie(0);
  ;
  cin >> n >> a >> b;
  for (int i = 1; i <= n; ++i) {
    long long int x;
    cin >> x;
    v.push_back(x);
  }
  long long int f = v.front();
  v.pop_front();
  sort(v.begin(), v.end());
  long long int cnt = 0, ans = 0;
  arr[0] = f;
  for (auto u : v) {
    cnt++;
    arr[cnt] += (u + arr[cnt - 1]);
  }
  while (cnt >= 0) {
    if (((a * f) / arr[cnt]) >= b) {
      return cout << ans << "\n", 0;
    }
    ans++;
    cnt--;
  }
  return 0;
}
