Rook TASK_138 (BUGGED)

#include<stdio.h>
int n;
int table[11][11];
int ans[11][2];
int cal(int level,bool check[])
{
//  printf("Test %d\n",level);
    if(level < n){
        int max = -1;
        int mj;
        for(int i=0;i<n;i++){
            check[i] = true;
            int x = cal(level + 1,check);
            check[i] = false;
            if((table[level][i] + x) > max && !check[i]){
                max = (table[level][i] + x);
                mj = i;
            }

        }
        ans[level][0] = level;
        ans[level][1] = mj;
        return max;
    }
    return 0;
}
int main()
{
    scanf("%d",&n);
    bool check[n];for(int i=0;i<n;i++)check[i] = false;
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            scanf("%d",&table[i][j]);
        }
    }

    printf("%d\n",cal(0,check));
    for(int i=0;i<n;i++){
        printf("%d %d\n",ans[i][0]+1,ans[i][1]+1);
    }
}