codeforces730J（费用流）

每个人与源点连一条边，流量是1，费用为0.

每个人与编程队那个点连一条边，流量是p，费用为-a[i];

每个人与运动队那个点连一条边，流量是s，费用为-b[i];

编程队与运动队向汇点连一条边，流量分别为，p，s。费用为0；

最大值就是 最小费用的取反。

然后遍历边数组，流量不为0 的边并且起点是1-n的，终点是运动队就是运动队的人，是编程队就是编程队的人。

#include<cstdio>
#include<vector>
#include<queue>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn = 3000+50;
int a[maxn],b[maxn];
#define N 3050
#define INF 100000000

struct Edge
{
    int from,to,cap,flow,cost;
    Edge(int u,int v,int ca,int f,int co):from(u),to(v),cap(ca),flow(f),cost(co){};
};

struct MCMF
{
    int n,m,s,t;
    vector<Edge> edges;
    vector<int> G[N];
    int inq[N];
    int d[N];
    int p[N];
    int a[N];

    void init(int n)
    {
        this->n=n;
        for(int i=0;i<n;i++)
            G[i].clear();
        edges.clear();
    }

    void addedge(int from,int to,int cap,int cost)
    {
        edges.push_back(Edge(from,to,cap,0,cost));
        edges.push_back(Edge(to,from,0,0,-cost));
        int m=edges.size();
        G[from].push_back(m-2);
        G[to].push_back(m-1);
    }

    bool SPFA(int s,int t,int &flow,int &cost)
    {
        for(int i=0;i<n;i++)
            d[i]=INF;
        memset(inq,0,sizeof(inq));
        d[s]=0;inq[s]=1;p[s]=0;a[s]=INF;
        queue<int> Q;
        Q.push(s);
        while(!Q.empty())
        {
            int u=Q.front();
            Q.pop();
            inq[u]--;
            for(int i=0;i<G[u].size();i++)
            {
                Edge& e=edges[G[u][i]];
                if(e.cap>e.flow && d[e.to]>d[u]+e.cost)
                {
                    d[e.to]=d[u]+e.cost;
                    p[e.to]=G[u][i];
                    a[e.to]=min(a[u],e.cap-e.flow);
                    if(!inq[e.to])
                    {
                        inq[e.to]++;
                        Q.push(e.to);
                    }
                }
            }
        }
        if(d[t]==INF) return false;
        flow+=a[t];
        cost+=d[t]*a[t];
        int u=t;
        while(u!=s)
        {
            edges[p[u]].flow+=a[t];
            edges[p[u]^1].flow-=a[t];
            u=edges[p[u]].from;
        }
        return true;
    }

    int MincotMaxflow(int s,int t)
    {
        int flow=0,cost=0;
        while(SPFA(s,t,flow,cost));
        return cost;
    }
}mcmf;
int ta = 0,tb = 0;
int ansa[maxn],ansb[maxn];
int main()
{
    int n,p,s;
    scanf("%d%d%d",&n,&p,&s); mcmf.init(n+10);
    for(int i=1;i<=n;i++) scanf("%d",&a[i]);
    for(int i=1;i<=n;i++) scanf("%d",&b[i]);
    int x = n+1,y = x+1; int st = y+1,ed = st+1;
    for(int i=1;i<=n;i++) mcmf.addedge(st,i,1,0);
    for(int i=1;i<=n;i++) mcmf.addedge(i,x,1,-a[i]);
    for(int i=1;i<=n;i++) mcmf.addedge(i,y,1,-b[i]);
    mcmf.addedge(x,ed,p,0); mcmf.addedge(y,ed,s,0);
    printf("%d\n",-mcmf.MincotMaxflow(st,ed));
    int len = mcmf.edges.size();
    for(int i=0;i<len;i++)
    {
        Edge tmp = mcmf.edges[i];
        if(tmp.to==x&&tmp.flow!=0&&tmp.from>=1&&tmp.from<=n)  ansa[ta++] = tmp.from;
        else if(tmp.to==y&&tmp.flow!=0&&tmp.from>=1&&tmp.from<=n) ansb[tb++] = tmp.from;
    }
    for(int i=0;i<ta;i++)
    {
        if(i!=0) printf(" ");
        printf("%d",ansa[i]);
    }
    printf("\n");
    for(int i=0;i<tb;i++)
    {
        if(i!=0) printf(" ");
        printf("%d",ansb[i]);
    }
    printf("\n");
    return 0;
}