Codeforces 854 C Planning 贪心 最大堆

#include <iostream>
#include <cstdio>
#include <map>
#include <iterator>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <cstring>
#include <queue>
using namespace std;
typedef long long ll;

struct node {
    ll t;
    ll w;
    bool operator < ( const node & tmp ) const {
       return w == tmp.w ? t > tmp.t : w < tmp.w;
    }
    node(ll tt, ll ww): t(tt), w(ww) {}
};

priority_queue<node> q;
const int maxn = 3e5+10;
ll ans[maxn];

int main() {
    ll n, k;
    scanf( "%lld%lld", &n, &k );
    ll res = 0;
    for( int i = 1; i <= n+k; i++ ) {
        if( i <= n ) {
            ll w;
            scanf("%lld", &w);
            q.push(node(i,w));
        }
        if( i > k ) {
            node nn = q.top();
            q.pop();
            res += (i-nn.t)*nn.w;
            ans[nn.t] = i;
        }
    }
    printf( "%lld\n",res );
    for( int i = 1; i < n; i++ ) {
        printf( "%lld ", ans[i] );
    }
    printf( "%lld\n", ans[n] );
    return 0;
}