（codeforces 853A）Planning 贪心

A. 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
input
5 2
4 2 1 10 2
output
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分钟无法起飞飞机。给出每架飞机每延误一分钟的损失costi，问所有飞机都起飞后的最小损失为多少

思路：
飞机起飞要满足两个条件：不能再之前的时间之前和花费最大的飞机最好最先起飞。
由于从k+1~k+n每一时刻起飞一辆飞机，而在i时刻，为了满足时间要求只有前i量飞机可以起飞，所以我们只需要每次在前i个中找花费最大的即可。关于找最大花费，那就交给优先队列去完成就可以了

最先想到的思路是在满足最大花费优先的情况下调整顺序。。，傻逼了，后来在分析题目输出时直接按照正常逻辑模拟一遍就可以了

代码：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <queue>
using namespace std;

const int maxn = 300010;

struct node
{
    int pre,c;
    bool operator < (const node &a) const
    {
        return c < a.c;
    }
}nodes[maxn];
int n,k;

int main()
{
    while(scanf("%d%d",&n,&k)!=EOF)
    {
        for(int i=1;i<=n;i++)
        {
            scanf("%d",&nodes[i].c);
            nodes[i].pre = i;
        }
        priority_queue<node> q;
        for(int i=1;i<=k;i++) q.push(nodes[i]);
        long long sum = 0;
        for(int i=k+1;i<=k+n;i++)
        {
            if(i <= n) q.push(nodes[i]);
            node now = q.top(); q.pop();
            sum += (long long) (i-now.pre) * now.c;
            nodes[now.pre].pre = i;
        }
        printf("%lld\n",sum);
        for(int i=1;i<n;i++) printf("%d ",nodes[i].pre);
        printf("%d\n",nodes[n].pre);
    }
    return 0;
}