제출 #254429

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
254429		shrek12357	Job Scheduling (CEOI12_jobs)	C++14	0 / 100	278 ms	4088 KiB

jobs

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <map>
#include <set>
#include <climits>
#include <cmath>
#include <fstream>
#include <queue>
using namespace std;

int main() {
	int n, d, m;
	cin >> n >> d >> m;
	vector<int> nums(n);
	for (int i = 0; i < m; i++) {
		int temp;
		cin >> temp;
		temp--;
		nums[temp]++;
	}
	int lo = 0;
	int hi = 1000005;
	while (lo < hi) {
		int mid = (lo + hi) / 2;
		int counterCows = 0;
		for (int i = 0; i < n - d; i++) {
			counterCows += nums[i];
			counterCows = max(counterCows - mid, 0);
		}
		if (counterCows == 0) {
			hi = mid;
		}
		else {
			lo = mid + 1;
		}
	}
	cout << hi << endl;
}

• Subtask 1: 0 / 100