제출 #135185

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
135185		FedericoS	Gift (IZhO18_nicegift)	C++14	0 / 100	2055 ms	78712 KiB

nicegift

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef pair<int,int> pii;

int N,K,M;
pii A[1000006];
vector<int> V[3000006];

int main(){

	cin>>N>>K;
	for(int i=0;i<N;i++){
		cin>>A[i].first;
		A[i].second=i+1;
	}

	sort(A,A+N,greater<pii>());

	while(A[0].first and (M+1)*K<=3000000){
		V[M].push_back(A[K-1].first);
		for(int i=0;i<K;i++){
			A[i].first-=A[K-1].first;
			V[M].push_back(A[i].second);
		}
		sort(A,A+N,greater<pii>());		
		M++;
	}

	if(A[0].first)
		cout<<-1;
	else
		for(int i=0;i<M;i++){
			for(int x:V[i])
				cout<<x<<" ";
			cout<<"\n";
		}

}

• Subtask 1: 0 / 7
• Subtask 2: 0 / 11
• Subtask 3: 0 / 12
• Subtask 4: 0 / 19
• Subtask 5: 0 / 51