hdu 3339

题解以后再补上，是一道最小生成树加01背包的题

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <queue>
#include <cstring>
using namespace std;
const int M = 2000000;
const int INF = 1e+9;
const int N = 110;

struct edge{
    int to,cost;
    edge(int t,int c){
        to = t,cost = c;
    }
};

typedef pair<int,int> pii;
std::vector<edge> es[N];
int T,n,m;
int d[N],v[N],dp[M];

void dijkstra(int s){
    priority_queue<pii,vector<pii>,greater<pii> > que;
    fill(d,d+N,INF);
    d[s] = 0;
    que.push(pii(0,s));

    while(!que.empty()){
        pii p = que.top();que.pop();
        int v = p.second;
        if (d[v] < p.first) continue;
        for (int i = 0;i < es[v].size();++i){
            edge e = es[v][i];
            if (d[e.to] > d[v] + e.cost){
                d[e.to] = d[v] + e.cost;
                que.push(pii(d[e.to],e.to));
            }
        }
    }
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);

    cin >> T;
    while(T--){
        for (int i = 0;i < N;++i){
            es[i].clear();
        }
        int sum = 0;
        cin >> n >> m;
        for (int i = 0;i < m;++i){
            int s,t,c;
            cin >> s >> t >> c;
            es[s].push_back(edge(t,c));
            es[t].push_back(edge(s,c));
        }
        for (int i = 1;i <= n;++i){
            cin >> v[i];
            sum += v[i];
        }
        dijkstra(0);
        fill(dp,dp+M,INF);
        dp[0] = 0;
        for (int i = 1;i <= n;++i){
            for (int j = sum;j >= v[i];--j){
                dp[j] = min(dp[j],dp[j-v[i]]+d[i]);
            }
        }
        int x = sum/2+1,ans = INF;
        for (int i = x;i <= sum;++i){
            ans = ans > dp[i] ? dp[i] : ans;
        }
        if (ans == INF) cout << "impossible" << endl;
        else cout << ans << endl;
    }



    return 0;
}