# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
624854 | cacteyy | Job Scheduling (CEOI12_jobs) | C++17 | 1093 ms | 3812 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <algorithm>
using namespace std;
int n, m;
int* times;
int checkSum(int k) {
int out = 0;
int i = 0;
while (i < m) {
out++;
out = ((out > times[i]) ? out : times[i]);
for (int j = 0; j < k && i + j < m; i++, j++) {
if (times[i] > out) {
i--;
j--;
break;
}
}
}
return out;
}
int main() {
int k;
int d;
cin >> n >> d>>m;
times = new int[m] {0};
for (int i = 0; i < m; i++) {
cin >> times[i];
}
sort(times, times + (m - 1));
int lk = 1;
int mk = m;
int mid = (mk - lk) / 2 + lk;
while (lk < mk) {
mid = (mk - lk) / 2 + lk;
if (checkSum(mid) >= n + d) lk = mid + 1;
else mk = mid - 1;
}
int out = lk;
if (mk < lk && checkSum(mk) <= n + d) out = mk;
cout << out;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |