CF854C：Planning（思维）

最新推荐文章于 2021-05-20 07:05:51 发布

junior19

最新推荐文章于 2021-05-20 07:05:51 发布

阅读量376

点赞数

分类专栏：思维/规律

本文链接：https://blog.csdn.net/junior19/article/details/77898718

版权

思维/规律专栏收录该内容

59 篇文章 0 订阅

订阅专栏

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.

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.

题意：最小化，其中ti >= i。

思路：上式右边是常量，所以最小化左边即可，在两个数的ti可以交换的情况下，如ci*ti，cj*tj，若有ti < tj 且 ci < cj，那么交换ti和tj能获得更优解，作差即可验证，所以贪心策略是c越小的数选择越大的t，由于题目限定要ti > i，从小到大处理用set维护一个递增的序列即可。

# include <bits/stdc++.h>
# define mp make_pair
# define pb push_back
# define A first
# define B second
using namespace std;
typedef long long LL;
const int maxn = 3e5+3;
set<pair<int,int> >s;
int ans[maxn];
int main()
{
    LL sum = 0;
    int n, k, a;
    scanf("%d%d",&n,&k);
    for(int i=1; i<=n; ++i)
    {
        scanf("%d",&a);
        s.insert(mp(a, i));
        if(i >= k+1)
        {
            auto t = s.end(); --t;
            ans[t->B] = i;
            sum = sum + 1LL*(i-t->B)*t->A;
            s.erase(t);
        }
    }
    for(int i=1; i<=k; ++i)
    {
        auto t = s.end(); --t;
        ans[t->B] = n+i;
        sum = sum + 1LL*(i+n-t->B)*t->A;
        s.erase(t);
    }
    printf("%lld\n",sum);
    for(int i=1; i<=n; ++i) printf("%d ",ans[i]);
    puts("");
    return 0;
}