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>
using namespace std;
int n,k;
int a[1000005];
priority_queue<pair<int,int>> pq;
signed main()
{
ios_base::sync_with_stdio(0);cin.tie(0);
cin>>n>>k;
int sum=0;
for(int i=1;i<=n;i++)
{
cin>>a[i];
sum = (sum+a[i])%k;
pq.push({a[i],i});
}
if(sum!=0)
{
cout<<-1;
return 0;
}
while(!pq.empty())
{
vector<int> sc;
cout<<1<<" ";
for(int i=0;i<k;i++)
{
sc.push_back(pq.top().second);
a[sc.back()]--;
cout<<sc.back()<<" ";
pq.pop();
}
cout<<"\n";
for(auto x:sc)
if(a[x]>0)
pq.push({a[x],x});
}
}
/**
4 2
2 3 3 2
*/
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |