Pat 1085 perfect sequence (25 points) perfect sequence

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
       
    int n,maxnum=0;
    long long p;
    cin>>n>>p;
    vector<int>a(n);
    for(int i=0;i<n;i++){
    
        scanf("%d",&a[i]);
    }
    sort(a.begin(),a.end());
    for(int i=0;i<n;i++){
                    // Determine the minimum value m
        for(int j=i+maxnum;j<n;j++){
    
            if (a[j] <= a[i] * p) {
    
                maxnum=max(j-i+1,maxnum);
            }else break;
        }
    }
    cout<<maxnum;
    system("pause");
    return 0;
}