[伯俊/BOJ]236チップ作成[Silver 2](失敗)

#include <iostream>
#include <algorithm>
using namespace std;

int main()
{
	int N, K, i, arr[50] = { 0 }, pow[20] = { 0 }, powindex[10] = { 0 };

	cin >> N >> K;
	for (i = 0; i < N; i++)
		cin >> arr[i];

	//sort(arr[0], arr[N -1]);

	int j = N - 1;
	int k = K-1;
	int temp = K;
	i = N - 1;
	while(temp)
	{
		if (arr[i] != arr[i - 1])
		{
			powindex[k] = arr[i];
			pow[j] = i + 1;
			k--;
			j--;
			i--;
			temp--;
		}
		else
		{
			powindex[k] = arr[i];
			pow[j] = i;
			j--;
			pow[j] = i+1;
			j--;
			i-=2;
			k--;
			temp--;
		}
	}

	for (i = 0; i < K; i++)
			cout << powindex[i] << endl;

	for (i = 0; i < N; i++)
	{
		if (i != N - 1)
			cout << pow[i] << endl;
		else
			cout << pow[i];
	}

	return 0;
}