PAT.A1085. Perfect Sequence

Given a sequence of positive integers and another positive integer p. The sequence is said to be a "perfect sequence" if M <= m * p where M and m are the maximum and minimum numbers in the sequence, respectively.

Now given a sequence and a parameter p, you are supposed to find from the sequence as many numbers as possible to form a perfect subsequence.

Input Specification:

Each input file contains one test case. For each case, the first line contains two positive integers N and p, where N (<= 10⁵) is the number of integers in the sequence, and p (<= 10⁹) is the parameter. In the second line there are N positive integers, each is no greater than 10⁹.

Output Specification:

For each test case, print in one line the maximum number of integers that can be chosen to form a perfect subsequence.

Sample Input:

10 8
2 3 20 4 5 1 6 7 8 9

Sample Output:

8

#include <cstdio>
#include <cstring>
#include <string>
#include <algorithm>
#include <cmath>
#include <map>
#include <iostream>
using namespace std;
long long n, p;
long long a[100010];
int bs(int left, long long x) {
	int right = n - 1;
	if (a[n - 1] <= x) return n;
	int mid;
	while (left < right) {
		mid = (right + left) / 2;
		if (a[mid] <= x) {
			left = mid+1;
		//	printf("a");
		}
		else
			right = mid;
	//	printf("b");
	}
	return left;
}

int main(){
	scanf("%lld%lld", &n,&p);
	for (int i = 0; i < n; i++) {
		scanf("%lld", &a[i]);
	}
	sort(a, a + n);
	int ans = 1;
	for (int i = 0; i < n; i++) {
		int you=bs(i+1, a[i]*p);
		you = you - i;
		ans=max(ans,you);
	}
	printf("%d",ans);
	return 0;
	
}