Submission

Score: 100

User: Some1258

Problemset: แซงรอบ

Language: cpp

Time: 0.022 second

Submitted On: 2026-07-16 09:15:02

#include<bits/stdc++.h>
using namespace std;
int main(){
    int N;
    long long K;
    cin>>N>>K;
    vector<long long> S(N);
    long long fastest=LLONG_MAX;
    for(int i=0;i<N;i++){
        cin>>S[i];
        fastest=min(S[i],fastest);
    }
    int ans=0;
    for(long long time:S){
        if((K-1)*time<K*fastest){
            ans++;
        }
    }
    cout<<ans;
}