#include<iostream>
#include<algorithm>
using namespace std;
const int maxn = 100010;
int a[maxn],n,p;
int binarySearch(int i, long long x) {
if (a[n - 1] <= x)return n;
int l = i + 1, r = n - 1, mid;
while (l<r)
{
mid = (l + r) / 2;
if (a[mid]<=x)
{
l = mid+1;
}
else r = mid;
}
return l;
}
int main() {
cin >> n >> p;
for (int i = 0; i < n; i++)
{
cin >> a[i];
}
sort(a, a + n);
int t=1;
for (int i = 0; i < n; i++)
{
int j = binarySearch(i, (long long)a[i] * p);
t = max(t, j - i);
}
cout << t;
return 0;
}
1030 完美数列 (25分)
最新推荐文章于 2024-05-08 22:01:18 发布