P8838 [传智杯 #3 决赛] 面试 —DFS全排列

 

输入输出样例

输入 #1

6 6
1 9 1 9 8 1
1 1 4 5 1 4

输出 #1

1 3 2 4 6 5

#include <bits/stdc++.h>
#define bug printf("************\n");
#define fuck(x) cout << #x << " -> " << x << endl
#define endl '\n'
#define int long long
using namespace std;
constexpr int N = 1e3 + 10, inf = 0x3f3f3f3f;
int n, k;
int a[N], b[N];
int c[N];
bool vis[N];
bool flag;
bool check()
{
    for (int i = 1; i <= k; i++)
    {
        if (a[c[i]] < b[i])
        {
            return false;
        }
    }
    return true;
}
// 枚举答案数组；
void dfs(int u)
{
    if (u == k+1)
    {
        if (check())
        {
            for (int i = 1; i <= n;