Codeforces - 853A Planning 【贪心】

Description

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.

题意

输入第一行给出两个整数n，k，n代表n架飞机，k代表时间k

第二行依次给出n个数，第i个数a[i]代表第i架飞机本定于时间i起飞，没耽误时间1会损失$a[i]

现在机场出现问题，前k时间不允许飞机起飞。现在需要重新安排起飞顺序，问最少损失多少$。

不允许提前起飞。

解题思路

贪心按单位时间损失$从大到小排序 利用优先队列，为保证没有飞机提前起飞，在插入第k+1架飞机时才开始出队列，

ACCode

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <queue>
using namespace std;
const int maxn = 3e5+5;
typedef long long ll;
struct Plane {
	int t,c;	// pri表示优先级 
	Plane(int tt=0,int cc=0) {
		t = tt;
		c = cc;
	}
	friend bool operator < (const Plane p1,const Plane p2) {
		if(p1.c == p2.c)
			return p1.t < p2.t;
		return p1.c < p2.c;
	}
}p[maxn];
int ans[maxn]; 
int main()
{
	int n,k,c;
	scanf("%d%d",&n,&k);
	for(int i=1;i<=n;i++) {
		scanf("%d",&c);
		p[i].t = i;
		p[i].c = c;
	}
	ll tot = 0;
	priority_queue< Plane> q; 
	for(int i=1;i<=k;i++)
		q.push(p[i]);
	Plane temp;
	for(int i=k+1;i<=n+k;i++) {
		if(i <= n) q.push(p[i]);
		temp = q.top();
		q.pop();
		ans[temp.t] = i;
		tot += (ll)(i-temp.t)*temp.c;
	}
	printf("%lld\n",tot);
	for(int i=1;i<=n;i++) {
		printf("%d",ans[i]);
		if(i != n)
			printf(" "); 
	} 
	return 0;
}