浙江工业大学校赛 小马哥和数列

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

7#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
#include<cmath>
#include<iostream>
using namespace std;
typedef long long int ll;
ll num[100005];
int main(){
    ll n,p;
    while(~scanf("%lld%lld",&n,&p)){
        for(int i=0;i<n;i++)
            scanf("%lld",&num[i]);
        sort(num,num+n);
        ll maxn=n-1;
        ll minn=0;
        ll ans=0;
        while(1){
            if(num[minn]*p>=num[maxn]){
                ans=maxn-minn;
                maxn--;
                minn--;
                break;
            }
            else{
                minn++;
                if(minn==maxn)
                    break;
            }
        }
        while(maxn>=ans){
            if(num[minn-1]*p>=num[maxn]&&minn-1>=0){
                ans++;
                minn--;
            }
            minn--;
            maxn--;
        }
        printf("%lld\n",ans+1);
    }
    return 0;
}