#include <bits/stdc++.h>
int holes[100000];
void counting_sort(int n, int plv) {
  int range = 9;
  int i, ara[range + 1];
  int output[n];
  for (i = 0; i <= range; i++) ara[i] = 0;
  for (i = 1; i < n; i++) {
    ara[((holes[i] % (plv * 10)) - (holes[i] % plv)) / plv]++;
  }
  for (i = 1; i <= range; i++) ara[i] = ara[i - 1] + ara[i];
  for (i = n - 1; i > 0; i--) {
    output[ara[((holes[i] % (plv * 10)) - (holes[i] % plv)) / plv]] = holes[i];
    ara[((holes[i] % (plv * 10)) - (holes[i] % plv)) / plv]--;
  }
  for (i = 1; i < n; i++) holes[i] = output[i];
  return;
}
void radix_sort(int n, int max) {
  int i, t;
  for (t = 1; max / t > 0; t *= 10) {
    counting_sort(n, t);
  }
  return;
}
int main() {
  int i, n, s, A, B, m, max, c;
  scanf("%d %d %d", &n, &A, &B);
  scanf("%d", &holes[0]);
  m = ((double)A / B) * holes[0];
  max = -1;
  for (i = 1, s = holes[0]; i < n; i++) {
    scanf("%d", &holes[i]);
    s += holes[i];
    if (holes[i] > max) max = holes[i];
  }
  radix_sort(n, max);
  for (i = n - 1, c = 0; i > 0 && s > m; i--) {
    c++;
    s -= holes[i];
  }
  printf("%d\n", c);
  return 0;
}
