# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1011604 | gsn | Job Scheduling (CEOI12_jobs) | C++14 | 345 ms | 8480 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 <bits/stdc++.h>
#define int long long int
using namespace std;
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, d, m;
cin>>n>>d>>m;
vector<int> a(m), b(n-d);
for (int i=0;i<m;i++){cin>>a[i];b[a[i]]++;}
for (int i=0;i<m;i++){
int sum=0;
for(int j=0;j<n-d;j++)sum+=max(0LL, b[j]-i);
if(sum<=d*i){cout<<i<<" "<<sum;break;}
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |