头文件问题

#include<cstdio>
#include<iostream>
using namespace std;
int x[10005]={0},y[10005]={0},n,m,count,flag ,maxn = -1,hang[1005]={0},lie[1005]={0};
int main(){
    cin >> n;
    for(int i = 1;i <= n;i++)
	{
        for(int j = 1;j <= n;j++)
		{
            cin>>m;
            hang[i] += m; 
            lie[j] += m;  
            if(m == 0)
			{  
                count++;
                x[count] = i;
                y[count] = j; 
                flag = 1;
            }
        }
    }
    if(flag == 0) 
	{
		cout<<"Bad Game!\n";
	}
    if(flag == 1){
        for(int i = 1;i <= count;i++)
		{
            if(hang[x[i]] + lie[y[i]] > maxn)
            {
            	maxn = hang[x[i]] + lie[y[i]]; 
			} 
        }
        cout << maxn << endl;
    }
    return 0;
}

#include <bits/stdc++.h>
using namespace std;
int x[10005]={0},y[10005]={0},n,m,count,flag ,maxn = -1,hang[1005]={0},lie[1005]={0};
int main(){
    cin >> n;
    for(int i = 1;i <= n;i++)
	{
        for(int j = 1;j <= n;j++)
		{
            cin>>m;
            hang[i] += m; 
            lie[j] += m;  
            if(m == 0)
			{  
                count++;
                x[count] = i;
                y[count] = j; 
                flag = 1;
            }
        }
    }
    if(flag == 0) 
	{
		cout<<"Bad Game!\n";
	}
    if(flag == 1){
        for(int i = 1;i <= count;i++)
		{
            if(hang[x[i]] + lie[y[i]] > maxn)
            {
            	maxn = hang[x[i]] + lie[y[i]]; 
			} 
        }
        cout << maxn << endl;
    }
    return 0;
}