Submission

Score: 78

User: dddrrrr

Problemset: แซงรอบ

Language: cpp

Time: 0.042 second

Submitted On: 2025-10-17 09:38:01

#include <bits/stdc++.h>
using namespace std;

int main(){
	cin.tie(0)->sync_with_stdio(0);
	cout.tie(0)->sync_with_stdio(0);
	
	int n ,lap;
	cin >> n >> lap;
	
	vector <int> vec(n);
	for(int i=0 ;i<n ;i++)cin >> vec[i]; 
	
	sort(vec.begin() ,vec.end());
		
		
	int m = n ,mul = 1;
	for(int i=1 ;i<lap ;i++){
		int fast = vec[0] * (i+1);
		
		for(int j=1 ;j<m ;j++){
			if(fast <= vec[j]*i)m = j;
		}
	}
	
	cout << m;
	return 0;
}