#include <bits/stdc++.h>
using namespace std;
const int maxn = 100010;
long long s[maxn];
int main(int argc, char const *argv[]) {
  long long n, a, b;
  scanf("%lld%lld%lld", &n, &a, &b);
  long long sum = 0;
  for (int i = 1; i <= n; i++) {
    scanf("%lld", &s[i]);
    sum += s[i];
  }
  sort(s + 2, s + n + 1);
  long long cnt = 0;
  for (int i = n; i >= 1; i--) {
    if (s[1] * a >= b * sum) {
      break;
    } else {
      cnt++;
      sum -= s[i];
    }
  }
  printf("%lld\n", cnt);
  return 0;
}
