1030 完美数列 （25 分）

#include<cstdio>
#include<algorithm>
using namespace std;
const int maxn = 100010;
int a[maxn];
int n,p;

int BinarySearch(int left,int right){
    
    int mid;
    long temp= a[left] * p;
    if(a[right] <= temp) return n;
    while(left < right){
        mid = (left + right) / 2;
        if(a[mid] == temp) return mid;
        else if(a[mid] > temp) right = mid;
        else left = mid + 1;
    }
    return left;
}

int main(){
    scanf("%d%d",&n,&p);
    for(int i = 0; i < n; i++){
        scanf("%d",&a[i]);
    }
    sort(a,a+n);
    int maxLen = -1;
    for(int i = 0; i < n; i++){
        int iTemp = BinarySearch(i + 1,n-1);
        maxLen = max(iTemp - i,maxLen);
    }
    printf("%d",maxLen);
    return 0;
}