poj 1833 排列 [ 使用STL的next_permutation函数生成全排列 + STL中copy函数的用法完美解决 ]

#include <iostream>
#include <string>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <cmath>
#include <vector>
#include <stack>
#include <deque>
#include <queue>
#include <bitset>
#include <list>
#include <map>
#include <set>
#include <iterator>
#include <algorithm>
#include <functional>
#include <utility>
#include <sstream>
#include <climits>
#include <cassert>
#define MID(x,y) ( ( x + y ) >> 1 )
#define L(x) ( x << 1 )
#define R(x) ( x << 1 | 1 )
#define BUG puts("here!!!");
#define STOP system("pause");

using namespace std;
const int N = 1025;

int num
;

int n, k, T;

int main() {
cin >> T;
while(T--) {
scanf("%d%d", &n, &k);
for(int i = 0; i < n; i++) {
scanf("%d", &num[i]);
}
for(int i = 0; i < k; i++) {
next_permutation(num, num + n);
}
copy(num, num + n - 1, ostream_iterator<int>(cout, " "));
cout << num[n-1] << endl;
}
return 0;
}