백준/백준-C++

10972번: 다음 순열

Beabletoet 2017. 6. 14. 19:28

#include<cstdio>

#include<algorithm>

int s[10000];

int main()

{

int n;

scanf("%d", &n);

for (int i = 0; i < n; ++i)

scanf("%d", &s[i]);

if (std::next_permutation(&s[0], &s[n]))

for (int i = 0; i < n; ++i)

printf("%d ", s[i]);

else

printf("-1");

}