Submission

Status:

PPPPPPPP

Score: 100

User: solarsunny

Problemset: แซงรอบ

Language: cpp

Time: 0.032 second

Submitted On: 2025-03-09 13:14:41

#include <bits/stdc++.h>
using namespace std;
int main() {
    int n=0;
    int k=0;
    cin >> n >> k;
    int run[n];
    for(int i=0;i<n; i++) {
        cin >> run[i];
    }

    sort(&run[0],&run[n]);

    int fast = run[0]*k;
    int notlap = 0;

    for(int i=0; i<n; i++) {
        if((run[i]*(k-1)) < fast) {
            notlap++;
        } else {
            break;
        }
    }
    cout << notlap << endl;
}