제출 #874471

#제출 시각아이디문제언어결과실행 시간메모리
874471vjudge1Job Scheduling (CEOI12_jobs)C++17
0 / 100
190 ms3940 KiB
#include <bits/stdc++.h>
using namespace std;
const int mxn=1e6+5;
int n,m,d,a[mxn];
int main(){
	cin>>n>>d>>m;
	for(int i=1;i<=m;i++){
		cin>>a[i];
	}
	a[m+1]=1e9;
	sort(a+1,a+m+1);
	int l=0,r=m;
	while(r-l>1){
		//cout<<r<<" "<<l<<endl;
		int mid=(l+r)/2,p=1;
		for(int i=1;i<=n;i++){
			int cnt=0;
			while(cnt<mid && a[p]<=i){
				cnt++;
				p++;
			}
		}
		if(p>m){
			r=mid;
		}
		else{
			l=mid;
		}
	}
	cout<<r<<endl;
}
#Verdict Execution timeMemoryGrader output
Fetching results...