#include <cstdio>
#include <algorithm>
using namespace std;
int main(){
int n, p;
scanf("%d %d", &n, &p);
int arr[n];
for(int i=0; i<n; i++){
scanf("%d", &arr[i]);
}
sort(arr, arr+n);
int count = -1;
int j = 0;
for(int i=0; i<n; i++){
for(; j<n; j++){
if(arr[j] > (long long)arr[i]*p){
break;
}
}
count = max(count, j-i);
}
printf("%d", count);
return 0;
}
PAT B1030 完美数列 (25分)(双指针算法)
猜你喜欢
转载自blog.csdn.net/weixin_45964844/article/details/111985424
今日推荐
周排行