#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
int holeSize[maxn];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int n, A, B, s1;
  cin >> n >> A >> B >> s1;
  int sum = s1;
  for (int i = 0; i < n - 1; ++i) {
    cin >> holeSize[i];
    sum += holeSize[i];
  }
  int maxSum = (A * s1) / B;
  sort(holeSize, holeSize + n - 1);
  int blockedHoles = 0;
  for (int i = n - 2; i >= 0 && sum > maxSum; --i) {
    sum -= holeSize[i];
    blockedHoles++;
  }
  cout << blockedHoles << endl;
  return 0;
}
