【Basic Level】
*1030 10个1 50个20
#include <iostream>
using namespace std;
int main()
{
int n;
long long p;
cin >> n >> p;
long long *a = new long long[n]{};
for (int i = 0; i < n; ++i)
{
cin >> a[i];
}
sort(a, a + n);
int max = 0;
for (int i = 0; n - i > max; ++i)
{
int j = i + max;
while (a[j] * 1.0 / a[i] <= p && j < n)
{
++j;
}
int cur = j - i;
if (cur > max)
{
max = cur;
}
}
cout << max << endl;
//system("pause");
return 0;
}