codeforces 853A

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 ，问所有飞机都起飞后的最小损失为多少

分析：很明显要把等的时间最长的先取出来，优先队列即可

#include <bits/stdc++.h>
using namespace std;
pair<int,int> P;

priority_queue<pair<int,int> > Q;
int ans[300010];
int a[300010];

int main()
{
	int n,k;
	cin>>n>>k;
	for(int i=1;i<=k;i++)
	{
		int x;
		cin>>x;
		Q.push(make_pair(x,i));
	}

	long long res=0;

	for(int i=k+1;i<=n;i++)
	{
		int x;
		cin>>x;
		Q.push(make_pair(x,i));

		ans[Q.top().second]=i;
		res+=1ll*Q.top().first*(i-Q.top().second);
		Q.pop();
	}

	for(int i=n+1;i<=n+k;i++)
	{
		ans[Q.top().second]=i;
		res+=1ll*Q.top().first*(i-Q.top().second);
		Q.pop();
	}

	cout<<res<<endl;
	for(int i=1;i<=n;i++){
		cout<<ans[i]<<" ";
	}
}