Contest Score （优先队列）

题意：可以在短时间内（可忽略）看k个问题。然后选择一个问题回答，计算时间，（包括之前花的时间）。

如果题没读完可以接着读。

#include<bits/stdc++.h>
using namespace std;

#define pi acos(-1)
#define endl '\n'
#define rand() srand(time(0));
#define me(x) memset(x,0,sizeof(x));
#define foreach(it,a) for(__typeof((a).begin()) it=(a).begin();it!=(a).end();it++)
#define close() ios::sync_with_stdio(0);

typedef long long LL;
const int INF=0x3f3f3f3f;
const LL LINF=0x3f3f3f3f3f3f3f3fLL;
//const int dx[]={-1,0,1,0,-1,-1,1,1};
//const int dy[]={0,1,0,-1,1,-1,1,-1};
const int maxn=1e4+5;
const int maxx=1e6+100;
const double EPS=1e-7;
const int MOD=10000007;
typedef pair<int, int>P;
#define mod(x) ((x)%MOD);
template<class T>inline T min(T a,T b,T c) { return min(min(a,b),c);}
template<class T>inline T max(T a,T b,T c) { return max(max(a,b),c);}
template<class T>inline T min(T a,T b,T c,T d) { return min(min(a,b),min(c,d));}
template<class T>inline T max(T a,T b,T c,T d) { return max(max(a,b),max(c,d));}
long long gcd(long long a , long long b){if(b==0) return a;a%=b;return gcd(b,a);}
#define FOR(x,n,i) for(int i=x;i<=n;i++)
#define FOr(x,n,i) for(int i=x;i<n;i++)
#define W while


priority_queue<int, vector<int>, greater<int> > qi2;
queue<int>qi1;
int main()
{
    int n,k;
    cin>>n>>k;
    FOR(1,n,i)
    {
        int x;
        cin>>x;
        qi1.push(x);
    }
    FOR(1,k,i)
    {
        qi2.push(qi1.front());
        qi1.pop();
    }
    LL ans=0,tmp=0;
    W(qi2.size())
    {
        tmp+=qi2.top();
        ans+=tmp;
        qi2.pop();
        if(qi1.size())
        {
            qi2.push(qi1.front());
            qi1.pop();
        }
    }
    cout<<ans<<endl;
}