Rt，请大佬看看

#include<iostream>
#include<cstdio>
#include<cmath>
#include<string>
#include<cstring>
#include<algorithm>
#include<queue>
#include<stack>
#include<vector>
#include<map>
#include<complex>
using namespace std;
inline int read(){
	int x=0,f=1;char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
	return x*f;
}
const int inf=2147483647;
int maxn,cost;
int top=1,head[5001];
int dis[5001];
int n,m,s,t,book[5001],c[5001][5001],d[5001],e[5001];
struct point{
    int v,w,val,next;
}a[100001];
struct b{
    int fa;
    int v;
}b[5001];
inline void add(int u,int v,int val,int w){
    a[++top].v=v;
    a[top].val=val;
    a[top].w=w;
    a[top].next=head[u];
    head[u]=top;
}
bool spfa(){
	queue<int> q;
    memset(b,0,sizeof(b));
    memset(book,0,sizeof(book));
    for(int i=0;i<=n;i++)
    	dis[i]=inf;
    dis[s]=0;
    q.push(s);
    book[s]=1;
    while(!q.empty()){
        int u=q.front();
        book[u]=0;
        q.pop();
        for(int i=head[u];i;i=a[i].next){
            int v=a[i].v,w=a[i].w;
            if(a[i].val>0&&dis[v]>dis[u]+w){
                dis[v]=dis[u]+w;
                b[v].fa=u,b[v].v=i;
                if(book[v]==0){
                    q.push(v);
                    book[v]=1;
                }
            }
        }
    }
    return dis[t]!=inf;
}
void EK(){
    while(spfa()){
        int minn=inf;
        for(int i=t;i!=s;i=b[i].fa)
			minn=min(minn,a[b[i].v].val);
        for(int i=t;i!=s;i=b[i].fa){
            a[b[i].v].val-=minn;
            a[b[i].v^1].val+=minn;
        }
        maxn+=minn;
        cost+=minn*dis[t];
    }
    return;
}
int main()
{
    m=read(),n=read();
    s=0;
	t=m+n+1;
    for(int i=1;i<=m;i++){
    	d[i]=read();
    	add(s,i,d[i],0);
		add(i,s,0,0);
	}
	for(int i=1;i<=n;i++){
		e[i]=read();
		add(i+m,t,e[i],0);
		add(t,i+m,0,0);
	}
	for(int i=1;i<=m;i++)
		for(int j=1;j<=n;j++){
			c[i][j]=read();
			add(i,j+m,inf,c[i][j]);
			add(j+m,i,0,-c[i][j]);
		}
    EK();
    cout<<cost<<endl;
    top=1;
    memset(a,0,sizeof(a));
	memset(head,0,sizeof(head));
	for(int i=1;i<=m;i++){
    	add(s,i,d[i],0);
		add(i,s,0,0);
	}
	for(int i=1;i<=n;i++){
		add(i+m,t,e[i],0);
		add(t,i+m,0,0);
	}
	for(int i=1;i<=m;i++)
		for(int j=1;j<=n;j++){
			add(i,j+m,inf,-c[i][j]);
			add(j+m,i,0,c[i][j]);
		}
    EK();
    cout<<-cost;
    return 0;
}