#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100100;
bool comp(long long a, long long b) { return a > b; }
int main() {
  long long n, a, b, s[MAXN], k = 0;
  cin >> n >> a >> b;
  for (int i = 1; i <= n; i++) {
    cin >> s[i];
    k += s[i];
  }
  sort(s + 2, s + n + 1, comp);
  int i = 2;
  while (s[1] * a < k * b) {
    k -= s[i];
    i++;
  }
  cout << i - 2 << endl;
}
