FZU 2219【贪心】

外送一题：51nod1117

#include <cstdio>#include <queue>#include <algorithm>using namespace std;typedef long long LL;PRiority_queue<LL, vector<LL>, greater<LL> >q; // 定义小的先出队int main(){    int T,n,m,k,x;    scanf("%d",&T);    while(T--)    {        while(!q.empty()) q.pop();        scanf("%d%d%d",&n,&m,&k);        for(int i=0;i<n;i++)        {            scanf("%d",&x);            q.push(x);        }        while(q.size()>m)        {            q.pop();            q.push(q.top()+k);            q.pop();        }        while(q.size()>1)            q.pop();        printf("%d/n",q.top());    }    return 0;}