POJ1833 排列 调用全排列函数 用copy函数节省时间 即使用了ios同步代码scanf还是比较快

#include <map>
#include <set>
#include <stack>
#include <cmath>
#include <queue>
#include <cstdio>
#include <vector>
#include <string>
#include <cstring>
#include <iterator>
#include <iostream>
#include <algorithm>
#define debug(a) cout << #a << " " << a << endl
using namespace std;
const int maxn = 2*1e4 + 10;
const int mod = 10000;
typedef long long ll;
ll num[maxn];
int main() {
    std::ios::sync_with_stdio(false);
    ll t;
    scanf("%lld",&t);
    while( t -- ) {
        ll n, m;
        scanf("%lld %lld", &n, &m);
        for( ll i = 0; i < n; i ++ ) {
            scanf("%lld",&num[i]);
        }
        for( ll i = 0; i < m; i ++ ) {
            next_permutation( num, num + n );
        }
        copy( num, num+n-1, ostream_iterator<ll>(cout, " "));
        cout << num[n-1] << endl;
    }
    return 0;
}