PAT(Basic Level)_1030_完美数列

#include<cstdio>#include<algorithm>using namespace std;int main(){    int i,j;    int N;    scanf("%d",&N);    double p;    scanf("%lf",&p);    int nums[100000];    for(i=0;i<N;i++){        scanf("%d",nums+i);    }    sort(nums,nums+N);    for(j=N-1;nums[j]>nums[0]*p;j--);    int max=++j;    for(i=0;i<N;i++){        while(nums[j]<=nums[i]*p && j<N) j++;        if(j-i>max) max=j-i;    }    printf("%d",max);    return 0;}