CodeForces ~ 994B ~ Knights of a Polygonal Table （贪心）

题意

有N个骑士，武力值为p[i]，拥有c[i]个金币，每个骑士最多杀死k个武力值比他低的骑士，问每个人能获得的最多的金币数为多少？

---

思路：

按武力值排序，贪心击杀≤k个武力值低于自己且金币数最多的骑士即可。

#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5+5;
typedef long long ll;
int n, k;
struct Node
{
    int id, p, c;
    ll ans;
}a[MAXN];
int main()
{
    scanf("%d%d", &n, &k);
    for (int i = 0; i < n; i++) scanf("%d", &a[i].p), a[i].id = i;
    for (int i = 0; i < n; i++) scanf("%d", &a[i].c), a[i].ans = a[i].c;
    sort(a, a+n, [](Node x, Node y){ return x.p < y.p || x.p == y.p && x.c < y.c; });
    multiset<int, greater<int> > s;
    for (int i = 0; i < n; i++)
    {
        int cnt = 0;
        for (auto j: s)
        {
            if (cnt++ >= k) break;
            a[i].ans += j;
        }
        s.insert(a[i].c);
    }
    sort(a, a+n, [](Node x, Node y){ return x.id < y.id; });
    for (int i = 0; i < n; i++) printf("%lld ", a[i].ans);
    printf("\n");
    return 0;
}
/*
4 2
4 5 9 7
1 2 11 33
*/