994B - Knights of a Polygonal Table - CodeForces Solution

#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>

using namespace std;

int main()
{
    int n, k;
    cin >> n >> k;

    vector<long long> ans(n);
    vector<pair<pair<int, int>, int>> p(n);

    for (int i = 0; i < n; i++)
        cin >> p[i].first.first;

    for (int i = 0; i < n; i++)
    {
        cin >> p[i].first.second;
        p[i].second = i;
    }

    sort(p.begin(), p.end());

    long long mx = 0;
    priority_queue<int> q;

    for (int i = 0; i < n; i++)
    {
        mx += p[i].first.second;
        q.push(-p[i].first.second);
        ans[p[i].second] = mx;

        if (q.size() > k)
        {
            mx += q.top();
            q.pop();
        }
    }

    for (int i = 0; i < n; i++)
        cout << ans[i] << " ";

    return 0;
}