cf#294-c A and B and Team Training

http://codeforces.com/contest/519/problem/

给n个有经验的人和m个新手，要求将它们2:1 或者1:2组合，问最多可以组成几对

通过线性规划：

取最小值即可

#include<iostream>
#include<cstdio>
using namespace std;
int main()
{
    int n,m;
    scanf("%d%d",&n,&m);
    printf("%d\n",min((m+n)/3,min(n,m)));
    return 0;
}

 

转载于:https://www.cnblogs.com/kylehz/p/4316339.html