hdu 4546

思路是优先队列

先排序，

然后Item类记录sum是当前难度的和，next是下一个要取的题目

初始化推入0,0

然后循环m次，每次取出sum+a[next]，然后再推入2个，要么取next，要么不取这个，去取它的下一个

具体的看代码

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cassert>
#include <climits>
#include <ctime>
#include <numeric>
#include <vector>
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <complex>
#include <deque>
#include <functional>
#include <list>
#include <map>
#include <string>
#include <sstream>
#include <set>
#include <stack>
#include <queue>
using namespace std;
template<class T> inline T sqr(T x) { return x * x; }
typedef long long LL;
typedef unsigned long long ULL;
typedef long double LD;
typedef pair<int, int> PII;
typedef pair<PII, int> PIII;
typedef pair<LL, LL> PLL;
typedef pair<LL, int> PLI;
typedef pair<LD, LD> PDD;
#define MP make_pair
#define PB push_back
#define sz(x) ((int)(x).size())
#define clr(ar,val) memset(ar, val, sizeof(ar))
#define istr stringstream
#define FOR(i,n) for(int i=0;i<(n);++i)
const double EPS = 1e-6;
const int INF = 0x3fffffff;
const LL LINF = INF * 1ll * INF;
const double PI = acos(-1.0);

using namespace std;

int a[10005];

struct Item{
	int sum;
	int next;
	bool operator<(const Item& it) const{
		if(it.sum+a[it.next]==sum+a[next]) return next>it.next;
		return sum+a[next]>it.sum+a[it.next];
	}
};

int main(void){
      //freopen("","r",stdin);
	  int t,tt = 0;
	  scanf("%d",&t);
	  while(t--){
		  int n,m;
		  scanf("%d %d",&n,&m);
		  for(int i = 0;i<n;i++) scanf("%d",&a[i]);
		  sort(a,a+n);
		  priority_queue<Item> p;
		  p.push((Item){0,0});
		  Item it;
		  int ans;
		  for(int i = 0;i<m;i++){
			  it = p.top();p.pop();
			  ans = it.sum+a[it.next];
			  if(it.next+1<n){
				  p.push((Item){it.sum+a[it.next],it.next+1});
				  p.push((Item){it.sum,it.next+1});
			  }
		  }
		  printf("Case #%d: %d\n",++tt,ans);
	  }
}