#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
long long s[N], c[N];
bool cmp(int x, int y) { return s[x] > s[y]; }
int main() {
  long long n, A, B, sm = 0;
  cin >> n >> A >> B;
  for (int i = 1; i <= n; i++) {
    cin >> s[i];
    sm += s[i];
    c[i] = i;
  }
  swap(c[1], c[n]);
  sort(c + 1, c + n, cmp);
  int i = 0;
  while (s[1] * A < sm * B) {
    i++;
    sm -= s[c[i]];
  }
  cout << i;
  return 0;
}
