#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx2")
#pragma GCC optimize("Os")
using namespace std;
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  string str = "", s;
  long long n, x, y, b = 10000, k = 1, i, j = 0, t, sum = 0, c, d, m, a;
  vector<long long> v(200005);
  cin >> n >> a >> b;
  for (i = 0; i < n; i++) cin >> v[i], sum += v[i];
  t = v[0];
  sort(v.begin(), v.end(), greater<int>());
  for (auto pt = v.begin(); pt != v.end(); pt++) {
    if (*pt == t) {
      v.erase(pt);
      break;
    }
  }
  v.insert(v.begin(), t);
  while ((a * t / sum) < b && k < n) {
    sum -= v[k++];
    ++j;
  }
  cout << j;
  return 0;
}
