1085. Perfect Sequence (25)

#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;

#define N 100000

int main(int argc, char **argv) {
	int n, p;
	cin >> n >> p;

	long long seq[N] = {};
	for(int i = 0; i < n; i ++) {
		scanf("%lld", &seq[i]);
	}

	sort(seq, seq+n);

	int count = 0;
	for(int i = 0; i < n; i ++) {
		long long *pmind = &seq[i];
		long long *pmaxd = upper_bound(seq, seq+n, seq[i]*p);
		int c = pmaxd-pmind;
		if(c > count)
			count = c;
	}

	cout << count << endl;

	return 0;
}