PAT 完美数列

完美数列

#include<stdio.h>
void quicksort1(int arr[],int left,int right)//快速排序   
{
	if(left<right)
	{
		int key = arr[left];
		int i = left,j = right;
		while(i<j)
		{
			while(i<j && arr[j]>=key) --j;
			if(i<j) arr[i++] = arr[j];
			while(i<j && arr[i]<=key) ++i;
			if(i<j) arr[j--] = arr[i];
		}
		arr[i] = key;
		quicksort1(arr,left,i-1);
		quicksort1(arr,i+1,right);
	}
}
int main()
{
	int p;
	int i,j,N,num[100000],count=0;
	scanf("%d %d",&N,&p);
	for(i=0;i<N;i++)
		scanf("%d",&num[i]);
		quicksort1(num,0,N-1);
	for(i=0;i<N;i++)
		for(j=i+count;j<N;j++)
		{
			if(num[j]>num[i]*p)
				break;
			count++;
		}
	printf("%d",count);
	return 0;
}