#include <bits/stdc++.h>
using namespace std;
bool check(int a, int b, int frst, int s) {
  return a * frst / (double)s >= (double)b;
}
int main() {
  int n, a, b, *arr;
  cin >> n >> a >> b;
  arr = new int[n];
  for (int i = 0; i < n; i++) {
    cin >> arr[i];
  }
  sort(arr + 1, arr + n);
  for (int i = 1; i < n; i++) {
    arr[i] = arr[i] + arr[i - 1];
  }
  int l = 0, r = n - 1, ans;
  while (l <= r) {
    int mid = (l + r) / 2;
    bool now = check(a, b, arr[0], arr[mid]);
    bool nx = check(a, b, arr[0], arr[mid + 1]);
    if (mid == n - 1 || (now && !nx)) {
      ans = mid;
      break;
    } else if (now && nx) {
      l = mid + 1;
    } else {
      r = mid - 1;
    }
  }
  cout << n - (ans + 1) << endl;
  return 0;
}
