本人代码：

#include<iostream>
#include<algorithm>
using namespace std;

int mp[1010][1010], s[1000010];

int main()
{
    int n, flag = 1;
    cin >> n;
    for(int i = 1; i <= n; i++)
    {
        for(int j = 1; j <= n; j++)
        {
            cin >> mp[i][j];
            if(mp[i][j] == 0) flag = 0;
        }
    }
    if(flag == 1)
    {
        cout << "Bad Game!" << endl;
        return 0;
    }
    int cnt = 1;
    for(int i = 1; i <= n; i++)
    {
        for(int j = 1; j <= n; j++)
        {
            if(mp[i][j] != 0) continue;
            else
            {
                for(int k = 1; k <= n; k++)
                    s[cnt] += mp[i][k];
                for(int k = 1; k <= n; k++)
                    s[cnt] += mp[k][j];
                cnt++;
            }
        }
    }
    sort(s + 1, s + cnt);
    cout << s[1] << endl;
    return 0;
}