Planning - Codeforces - 854C

Planning

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时刻前的飞机必须延误，并且重新安排的过程中不允许任何一架飞机提前起飞；每架飞机延误一分钟就要花费相应的代价，求最小代价以及对应的时刻表。

思路：

这是考贪心思路的题目。由于飞机的延误要花费代价，我们希望这个代价越小越好。因此，每架飞机都应该尽早起飞，即只要找到适合它起飞的时刻就立马安排它起飞，不考虑继续延误的情况。
由上述思路可以得到以下实现方法：设延误代价大的飞机优先级高，随着输入的顺序将每架飞机的数据插入优先队列，只要输入的架次是第 k <script type="math/tex" id="MathJax-Element-68">k</script> 架及以上，每输入一架飞机就弹出队顶，将它安排在当前这个时刻起飞。这样子的操作可以确保每架飞机最早于原定时间起飞（即不延误），同时确保最终的花费最低。

注意数据类型，数据量大时int会溢出，应该采用long long或更大的数据类型。

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <utility>
#include <queue>
typedef long long ll;
using namespace std;
const int maxn = 3e5+19;

struct node{
    int first, second;
    bool operator < (const node &temp)const{
        return first < temp.first;
    }
};
int pos[maxn];

int main(){
#ifdef TEST
freopen("test.txt", "r", stdin);
#endif // TEST

    ll k, n;
    while(cin >> n >> k){
        priority_queue<node> Q;
        ll sum = 0;
        for(ll i = 1; i <= n+k; i++){
            int a;
            if(i <= n){
                scanf("%d", &a);
                Q.push(node{a, i});
            }
            if(i >= k+1){
                node tNode = Q.top();
                Q.pop();
                sum += (i-tNode.second)*tNode.first; // 作为循环变量的i为long long，故不需显式类型转换了。
                pos[tNode.second] = i;
            }
        }
        printf("%lld\n", sum);
        for(int i = 1 ;i <= n; i++){
            printf("%d%c", pos[i], " \n"[i==n]);
        }
    }

    return 0;
}