Leha and Function CodeForces - 841C 组合数

稍微推一下，我们可以猜测 F（n, k）中 n 尽量大， k 尽量小，就能使得 F 尽量大
然后呢，，cf 还是要敢于猜的，40分钟想到了这一点，没敢写，最后交上对了

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <ctype.h>
#include <vector>
#include <algorithm>
#define in freopen("in.txt", "r", stdin)
#define out freopen("out.txt", "w", stdout)
// cout << "  ===  " << endl;

using namespace std;
typedef long long ll;
const int maxn = 1000000 + 7, INF = 0x7f7f7f7f, mod = 1e9+7;
int T, n, k, v;
int b[maxn];

struct node {
    int v;
    int id;
    int bb;
}a[maxn];
bool cmp(node a, node b) {
    return a.v > b.v;
}
int vis[maxn] = {0};
int dd[maxn];

int main() {
    scanf("%d", &n);
    for(int i = 0; i < n; ++i) {
        scanf("%d", &b[i]);
    }
    sort(b, b+n);
    for(int i = 0; i < n; ++i) {
        scanf("%d", &a[i].v);
        a[i].id = i;
    }
    sort(a, a+n, cmp);
    for(int i = 0; i < n; ++i) {
        dd[a[i].id] = b[i];
    }
    for(int i = 0 ; i < n; ++i) {
        if(i) cout << " ";
        cout << dd[i];
    }

    return 0;
}