codefroce 854 A.Fraction

题解：贪心，每次从能够出发的飞机中取一个最大的就好啦，用一个队列维护一下~

ac代码：

#include <cstdio>
#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <stack>
#include <map>
using namespace std;
typedef long long ll;
struct node
{
    ll v;
    int id;
    friend bool operator <(node a,node b)
    {
        return a.v < b.v;
    }
}a[];

int tt[];
int main()
{
    int n,m;
    scanf("%d %d",&n,&m);
    for(int i=;i<=n;i++)
    {
        scanf("%I64d",&a[i].v);
        a[i].id=i;
    }
    ll ans=;
   // cout<<"12"<<endl;
    priority_queue<node> que;
    int time=m;
    for(int i=;i<=m;i++) que.push(a[i]);
   // cout<<"123"<<endl;
    while(!que.empty())
    {
        ++time;
        if(time <= n)que.push(a[time]);
        node now=que.top();
        que.pop();
        int id=now.id;
        tt[id]=time;// now time
        ans+=(time-id)*a[id].v;
    }
    //cout<<"1234"<<endl;
    printf("%I64d\n",ans);
    printf("%d",tt[]);
    for(int i=;i<=n;i++) printf(" %d",tt[i]);
    cout<<endl;
    return ;
}