#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int dir4[4][2] = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
const int dir8[8][2] = {{1, 0}, {0, 1},   {-1, 0}, {0, -1},
                        {1, 1}, {-1, -1}, {1, -1}, {-1, 1}};
const int dir63[6][3] = {{0, 0, 1},  {0, 0, -1}, {0, 1, 0},
                         {0, -1, 0}, {1, 0, 0},  {-1, 0, 0}};
const int daym[2][13] = {{0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31},
                         {0, 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}};
int GCD(int a, int b) { return b ? GCD(b, a % b) : a; }
int p[100010];
int main() {
  int n, a, b, k = 0;
  long long sum = 0;
  scanf("%d %d %d", &n, &a, &b);
  for (int i = 0; i < n; i++) {
    scanf("%d", &p[i]);
    sum += p[i];
  }
  if (a * 1.0 / sum * p[0] >= b) {
    printf("0\n");
    return 0;
  }
  sort(p + 1, p + n);
  for (int i = n - 1; i >= 0; i--) {
    sum -= p[i];
    k++;
    if (a * 1.0 / sum * p[0] >= b) {
      break;
    }
  }
  printf("%d\n", k);
  return 0;
}
