다음 순열 - 10972

문제 :

https://www.acmicpc.net/problem/10972

10972번: 다음 순열

 

소스 : 

#include <iostream>
#include <algorithm>

using namespace std;

int main()
{
	int n;
	cin >> n;

	int num[10000] = {0};
	for (int i = 0; i < n; i++)
	{
		cin >> num[i];
	}
	bool check = next_permutation(num, &num[n]);
	if (check)
	{
		for (int i = 0; i < n; i++)
		{
			cout << num[i];
			if (i + 1 < n)
			{
				cout << " ";
			}
		}
		cout << "\n";
	}
	else
	{
		cout << -1 << endl;
	}

	return 0;
}