CodeForces854C（优先队列）

C. Planning
time limit per test1 second
memory limit per test512 megabytes
inputstandard input
outputstandard output
Helen works in Metropolis airport. She is responsible for creating a departure schedule. There are n flights that must depart today, the i-th of them is planned to depart at the i-th minute of the day.

Metropolis airport is the main transport hub of Metropolia, so it is difficult to keep the schedule intact. This is exactly the case today: because of technical issues, no flights were able to depart during the first k minutes of the day, so now the new departure schedule must be created.

All n scheduled flights must now depart at different minutes between (k + 1)-th and (k + n)-th, inclusive. However, it’s not mandatory for the flights to depart in the same order they were initially scheduled to do so — their order in the new schedule can be different. There is only one restriction: no flight is allowed to depart earlier than it was supposed to depart in the initial schedule.

Helen knows that each minute of delay of the i-th flight costs airport ci burles. Help her find the order for flights to depart in the new schedule that minimizes the total cost for the airport.

Input
The first line contains two integers n and k (1 ≤ k ≤ n ≤ 300 000), here n is the number of flights, and k is the number of minutes in the beginning of the day that the flights did not depart.

The second line contains n integers c1, c2, …, cn (1 ≤ ci ≤ 107), here ci is the cost of delaying the i-th flight for one minute.

Output
The first line must contain the minimum possible total cost of delaying the flights.

The second line must contain n different integers t1, t2, …, tn (k + 1 ≤ ti ≤ k + n), here ti is the minute when the i-th flight must depart. If there are several optimal schedules, print any of them.

Example
inputCopy
5 2
4 2 1 10 2
outputCopy
20
3 6 7 4 5
Note
Let us consider sample test. If Helen just moves all flights 2 minutes later preserving the order, the total cost of delaying the flights would be (3 - 1)·4 + (4 - 2)·2 + (5 - 3)·1 + (6 - 4)·10 + (7 - 5)·2 = 38 burles.

However, the better schedule is shown in the sample answer, its cost is (3 - 1)·4 + (6 - 2)·2 + (7 - 3)·1 + (4 - 4)·10 + (5 - 5)·2 = 20 burles.

题解题意自己看吧，表达能力不强。
本题可以用优先队列，现将前k个飞机放入优先队列，从第k+1个开始，边放入队列边输出最大值ci，（这样可以保证i时进来的飞机一定不早于i时起飞）同时记录第i个飞机何时起飞。
代码

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<queue>
using namespace std;
typedef long long ll;
struct fly
{
    int oder;
    int c;
    bool operator < (const fly &t)const//重载运算符
    {
        if(c != t.c)
            return c < t.c;
        else
            return oder < t.oder;
    }
} f[300005];
int main()
{
    int n,k;
    cin >> n >> k;
    priority_queue<fly,vector<fly>,less<fly> >q;//对应相应类型
    for(int i = 1; i <= n; i ++)
    {
        scanf("%d",&f[i].c);
        f[i].oder = i;
    }
    for(int i = 1; i <= k; i ++)
    {
        q.push(f[i]);//将1到k的未起飞的飞机入栈
    }
    ll sum = 0;
    for(int i = k+1; i <= n+k; i ++)
    {
        if(i <= n)
            q.push(f[i]);//k以后，边入栈边找最大值c
        fly a = q.top();
        q.pop();
        sum += (ll)(i-a.oder) * a.c;
        f[a.oder].oder = i;
    }
    cout << sum << '\n';
    for(int i = 1; i < n; i ++)
    {
        cout << f[i].oder << ' ' ;
    }
    cout << f[n].oder << '\n';
    return 0;
}