#include <bits/stdc++.h>   using namespace std;   int n, a, b, k[100100];   const int du = 0.000001;   bool cmp(int x, int y) { return x > y; }   int main() {     scanf( %d%d%d , &n, &a, &b);     long long sum = 0;     for (int i = 1; i <= n; ++i) {       scanf( %d , &k[i]);       sum += k[i];     }     if (a == b) {       printf( %d , n - 1);       return 0;     }     sort(k + 2, k + 1 + n, cmp);     double cnt = 0;     int xx = sum;     double hah = b;     cnt = a * k[1] / 1.0 / xx;     if (cnt >= b) {       printf( 0 n );       return 0;     }     for (int i = 2; i <= n; ++i) {       xx = xx - k[i];       cnt = a * k[1] / 1.0 / xx;       if (cnt >= b) {         printf( %d n , i - 1);         return 0;       }     }     printf( %d n , n);     return 0;   }   