1085. Perfect Sequence (25) two pointers法

#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <algorithm>

#include <string>
#include <cstring>
#include <vector>
#include <queue>

using namespace std;

long long a[100005]={0};

int main()
{
   // freopen("in.txt","r",stdin);

    int N,p;
    scanf("%d %d",&N,&p);

    for(int i=0;i<N;i++)
        scanf("%d",&a[i]);

    sort(a,a+N);

    int ans=-1;
    int i=0,j=0;
    while(i<N && j<N)
    {
        while(a[i]*p>=a[j] && j<N)
        {
            ans=max(ans,j-i+1);
            j++;
        }
        i++;
    }

    printf("%d",ans);


    return 0;
}