Codeforces Round #433 (Div. 2) - C - Planning

C. Planning

time limit per test

1 second

memory limit per test

512 megabytes

input

standard input

output

standard 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 = 20burles.

题意：

有n架飞机，最初时第 i 架飞机在第 i 秒起飞，因为一些问题，所有的航班都延后了，然后要对航班进行重新规划，已知第i架飞机起飞时间每比最初起飞时间迟1分钟就要花费ci的什么东西，第 i 架飞机起飞的时间只能比最初起飞时间晚或相同，求最少花费以及最少花费时所有飞机的起飞时间，每分钟只能有一架飞机起飞。

思路：

贪心 + 路径压缩，就是花费的越多的就推迟的越少，排序一下然后就找在 ≥ i 的时间内离i最近的未被使用的时刻， 我就用了一个链表一样的东西，有一个next数组代表该点下一个不被使用的时间，然后就是每次找完都压缩一下，不然就会超时了。

#include<iostream>
#include<string.h>
#include<stdio.h>
#include<algorithm>
#define LL long long
using namespace std;
const LL maxn = 300000;
LL n,k,ans[maxn+100],nx[maxn*2+100],vis[maxn*2+100];
struct node {LL cost,pos;}c[maxn+100];
bool cmp(node a,node b){return a.cost>b.cost;}
LL find(LL x)
{
    if(x<=k) x = k+1;
    LL b = x;
    while(vis[x]) x = nx[x];
    vis[x] = 1;
    LL ans = x;
    while(vis[x]) x = nx[x];
    while(vis[b]) {LL t = b;b = nx[b],nx[t] = x;}//路径压缩
    return ans;
}
int main()
{
    scanf("%lld%lld",&n,&k);
    for(int i=1;i<=n;i++) scanf("%lld",&c[i].cost),c[i].pos = i,nx[i+k]=i+k+1;
    nx[n+k] = -1;
    sort(c+1,c+1+n,cmp);//对飞机的延迟花费由大到小进行排序
    LL Ans = 0;
    for(int i=1;i<=n;i++)
    {
        LL now = c[i].pos;
        ans[now] = find(now);
        Ans+=(ans[now]-now)*c[i].cost;
    }
    printf("%lld\n",Ans);
    for(int i=1;i<=n;i++)
    {
        if(i-1) printf(" ");
        printf("%lld",ans[i]);
    }
    return 0;
}