2007: Football Training Camp

分析:枚举胜利场次即可，注意6，0 ； 1，4，1 等特殊处理

代码参考：http://www.cnblogs.com/52why/p/7497139.html

#include <cstdio>
#include <iostream>
#include <queue>
#include <algorithm>
using namespace std;
#define maxn 252
int n;
int a[maxn];
int main()
{
    while( cin >> n  )
    {
        for(int i = 1 ; i <= n ; ++i)
        {
            scanf("%d",a+i);
        }
        priority_queue<int>q;
        int m = 0 ;
        int sum = 0;
        for(int i = 1 ; i <= n ;++i){
            q.push(a[i]);
            m += a[i]/3;
            sum += a[i];
        }
        if( m == 0 ){
            printf("%d %d\n",sum/2,sum/2);continue;
        }
        int x1 = 0 , x2 = 0;
        int flag = 0 , ff = 0;
        if( sum%2 ){
            ff = 1;
            int top = q.top();q.pop();
            top -= 3;q.push(top);
            sum -= 3;
            m--;
        }
        if( 2*q.top() <= sum)
        {
            x1 = ff + sum/2;
            x2 = ff + sum/2;
            flag = 1;
        }
       for(int i=1; 2*i<=m; ++i)
       {
            int temp=q.top()-3;
            q.pop();
            q.push(temp);
            temp=q.top()-3;
            q.pop();
            q.push(temp);
            sum-=6;
            if((2*q.top()<=sum))//剩下的比分是否可以全部构成平局
            {
                x1=ff+2*i+sum/2;
                if(flag==0)
                {
                    x2=ff+2*i+sum/2;
                    flag=1;
                }

            }
        }
        printf("%d %d\n",x1,x2);
    }
}