3336：【例57.3】火星人
2026-02-02 12:26:29
栏目：最新资讯
5 阅读
#include
#include
#include
#include
using namespace std;
int main()
{
int n, m;
cin >> n >> m;
//录入数组
int* pa;
pa = new int[n];
for (int i = 0; i < n; i++)
{
int num;
cin >> num;
pa[i] = num;
}
//查找m位后的排列
for (int i = 0; i < m; i++)
{
next_permutation(pa, pa + n);
}
for (int i = 0; i < n - 1; i++)
{
cout << pa[i] << " ";
}
cout << pa[n - 1] << endl;
return 0;
}
|
本文地址：https://www.yitenyun.com/4988.html
