dijkstra优化的最小费用最大流

const int inf = 0x3f3f3f3f;
int tol,head[4010];
struct edge{
    int to,next,cap,flow,cost;
}es[8000010];
void init(){
    tol = 0; memset( head , -1 , sizeof(head) );
}
void addedge( int u , int v , int cap , int cost ){
    es[tol].to = v;
    es[tol].cap = cap;
    es[tol].cost = cost;
    es[tol].flow = 0;
    es[tol].next = head[u];
    head[u] = tol++;
    es[tol].to = u;
    es[tol].cap = 0;
    es[tol].cost = -cost;
    es[tol].flow = 0;
    es[tol].next = head[v];
    head[v] = tol++;
}
typedef pair<int,int> p; int dis[4010],h[4010],pre_node[4010],pre_edge[4010];

void MCMF( int s , int t , int n ){
    int flow = 0;
    int cost = 0;
    for( int i=0 ; i<n ; i++ ){
        h[i] = 0;
    }
    while( true ){
        for( int i=0 ; i<n ; i++ ){
            dis[i] = inf;
        }
        priority_queue<p,vector<p>,greater<p> >Q;
        dis[s] = 0;
        Q.push(make_pair(0,s));
        while( !Q.empty() ){
            p now = Q.top();
            Q.pop();
            int u = now.second;
            if( dis[u]<now.first ) continue;
            for( int i=head[u] ; i!=-1 ; i=es[i].next ){
                int v = es[i].to;
                int len = es[i].cost+h[u]-h[v];
                if( es[i].cap-es[i].flow&&dis[u]+len<dis[v] ){
                    dis[v] = dis[u]+len;
                    Q.push(make_pair(dis[v],v));
                    pre_node[v] = u;
                    pre_edge[v] = i;
                }
            }
        }
        if( dis[t]==inf ) break;
        for( int i=0 ; i<n ; i++ ){
            h[i] += dis[i];
        }
        int d = inf;
        for( int i=t ; i!=s ; i=pre_node[i] ){
            int a = pre_edge[i];
            d = min( d , es[a].cap-es[a].flow );
        }
        if( d==0 ) break;
        cost += d*h[t];
        for( int i=t ; i!=s ; i=pre_node[i] ){
            int a = pre_edge[i];
            es[a].flow += d;
            es[a^1].flow -= d;
        }
        flow += d;
    }
    printf( "%d\n" , -cost );
}