PAT A1085 perfect sequence (25)

#include<cstdio>
#include<algorithm>
#include<iostream>
using namespace std;
int cmp(int a,int b){return a<b;}
int main(){
int n,p,i;
int num[100010];
scanf("%d%d",&n,&p);
for(i=0;i<n;i++){
scanf("%d",&num[i]);
}
sort(num,num+n,cmp);
int j,maxnum=1;
long long mp;

/*
while(i<j){
mp=(long long)num[i]*p;
while(num[j]>mp && j>=0) j--;
if(i<=j && j>=0){
if((j-i+1)>maxnum) maxnum=j-i+1;
} 
i++;
mp=num[i]*p;
while(num[j]<=mp && j<n) j++;
j--;
if(i<=j && j>=0){
if((j-i+1)>maxnum) maxnum=j-i+1;
} 
}*/
for(i=0;i<n;i++){
mp=num[i]*p;
j=upper_bound(num+i+1,num+n,mp)-num;
maxnum=max(maxnum,j-i);
}
printf("%d",maxnum);
system("pause");
return 0;
}