# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
165794 | reda | Job Scheduling (CEOI12_jobs) | C++14 | 854 ms | 18364 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 pb push_back
#define mp make_pair
#define vct vector
#define pii pair<int,int>
#define all(a) a.begin(),a.end()
#define se second
using namespace std ;
vct <pii> v;
int main ()
{
int n , m , d ;
cin >> n >> d >> m ;
int arr[m];
for(int i =0 ;i <m;i++)
{
int k;
cin >>k;
v.pb(mp(k,i+1));
}
sort(all(v));
int ans = ceil(m/n +0.5);
cout<<ans<<endl;
for(int i= 0 ;i <n ;i++)
{
if(i<n-d){
for(int j=0;j<ans;j++)
{
cout<<v[i+j].se<<' ';
}
cout<<0<<endl;
}
else cout<<0<<endl;
}
return 0 ;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |