- problem link:http://poj.org/problem?id=1833
- 解题思路:题意就不讲了是个中文题。此题用排列函数next_permutation()很容易就解决了。还有就是我在用普通输出的时候超时了,就用了下面那种输出方式才过。请看代码:
- 3.
#include<cstdio>
#include<iostream>
#include<algorithm>
#include <iterator>
using namespace std;
const int N=1024;
int a[N];
int main(){
ios::sync_with_stdio(false);cin.tie(0);
int T;scanf("%d",&T);
while(T--){
int n,k;scanf("%d%d",&n,&k);
for(int i=0;i<n;i++)scanf("%d",&a[i]);
while(k--)next_permutation(a,a+n);
copy(a,a+n-1,ostream_iterator<int>(cout," "));
cout << a[n-1] << endl;
}
}