poj-1833-排列 stl next_permutation(a,a+n)

#include<cstdio>#include<algorithm>using namespace std;int t,n,m;int a[2000];int main(){    scanf("%d",&t);    while(t--)    {        scanf("%d%d",&n,&m);        for(int i=0;i<n;i++)         scanf("%d",&a[i]);        while(m--)        {            if(next_permutation(a,a+n)!=NULL);            else{                for(int i=0;i<n;i++)                  a[i]  =i+1;            }        }        for(int i=0;i<n-1;i++)           printf("%d ",a[i]);           printf("%d\n",a[n-1]);    }}