Minimum Cost

费用流问题， 

#include <iostream>
#include <string.h>
#include <stdio.h>
#include <stdlib.h>
#include <queue>

using namespace std;
#define MAXN 555
#define INF 0x1f1f1f
#define MAXE 50000

struct Edge
{
    Edge(){};
    Edge(int a, int b, int c, int d)
    {
         v = a;
         f = b;
         w = c;
         next = d;
    };
    int v, f, w, next;
};

int n, lmt;
int g[MAXE];
Edge e[MAXE];
int nume;
int src, sink;

void init()
{
    memset(g, 0, sizeof(g));
    nume = 1;
}
void Addedge(int u, int v, int c, int w)
{
    e[++nume] = Edge(v, c, w, g[u]);
    g[u] = nume;
    e[++nume] = Edge(u, 0, -w, g[v]);
    g[v] = nume;
}

queue<int> que;
bool inQue[MAXN];
int dist[MAXN];
int prev[MAXN], pree[MAXN];

bool findPath()
{
    while(!que.empty()) que.pop();
    que.push(src);
    memset(dist,INF, sizeof(dist));
    dist[src] = 0;
    inQue[src] = 1;
    while(!que.empty())
    {
        int u = que.front();
        que.pop();
        for(int i = g[u]; i; i = e[i].next)
        {
            if(e[i].f > 0 && dist[u] +e[i].w< dist[e[i].v])
            {
                dist[e[i].v] = dist[u] + e[i].w;
                prev[e[i].v] = u;
                pree[e[i].v] = i;
                if(!inQue[e[i].v])
                {
                    que.push(e[i].v);
                    inQue[e[i].v] = 1;
                }
            }
        }
        inQue[u] = false;
    }
    if(dist[sink] < INF) return 1;
    return false;
}

int augment()
{
    int u = sink;
    int delta = INF;
    while(u  != src)
    {
        if(e[pree[u]].f < delta) delta = e[pree[u]].f;
        u = prev[u];
    }
    u = sink;
    while(u != src)
    {
        e[pree[u]].f -= delta;
        e[pree[u]^1].f += delta;
        u = prev[u];
    }
    return dist[sink]*delta;
}

int mincostflow()
{
    int cur = 0, ans = INF;
    while(findPath())
      cur += augment();
    if(cur < ans) ans = cur;
    return ans;
}
int N, M, K;
int need[MAXN][MAXN], needk[MAXN];
int have[MAXN][MAXN], havek[MAXN];
int main()
{
    while(scanf("%d %d %d",&N, &M, &K)!= EOF &&( N+M+K))
    {
         memset(needk,0,sizeof(needk));
		for(int i=1;i<=N;i++)   //顾客
		for(int j=1;j<=K;j++)
		{
			scanf("%d",&need[i][j]);
			needk[j]+=need[i][j];
		}
		memset(havek,0,sizeof(havek));
		for(int i=1;i<=M;i++)  //供应商
		for(int j=1;j<=K;j++)
		{
			scanf("%d",&have[i][j]);
			havek[j]+=have[i][j];
		}

		bool flag=1;
		for(int i=1;i<=K;i++)
		if(needk[i]>havek[i])
		{
			flag = 0;
			break;
		}
		int val, ans = 0;
		src = 0, sink = N+M+1;
        for(int k = 1; k <= K; k++)
        {
            init();
            //jiantu
           for(int i=1;i<=N;i++)
			for(int j=1;j<=M;j++)
			{
				scanf("%d",&val);
				Addedge(j,M+i,have[j][k],val);
			}
            if(!flag) continue;
            //source -> supply place
           for(int i=1;i<=M;i++)  //源点向供应商建边
			  Addedge(src,i,have[i][k],0);

			for(int i=1;i<=N;i++) //顾客向汇点建边
			  Addedge(M+i, sink,need[i][k],0);
            ans += mincostflow();

        }

        if(!flag) puts("-1");
        else
          printf("%d\n",ans);
    }
}