AcWing 5415. 仓库规划

        昨天忘记发了，其实就是暴力枚举啦，时间复杂度摆在那

#include <bits/stdc++.h>

using namespace std;

const int N = 1010, M = 11;

int n, m;
int g[N][M];

int main()
{
    scanf("%d%d", &n, &m);
    for (int i = 1; i <= n; ++ i)
        for (int j = 1; j <= m; ++ j)
            scanf("%d", &g[i][j]);
    
    for (int i = 1; i <= n; ++ i)
    {
        int res = 0;
        for (int j = 1; j <= n; ++ j)
        {
            bool jud = true;
            for (int k = 1; k <= m; ++ k)
                if (g[i][k] >= g[j][k]) jud = false;
            if (jud) 
            {
                res = j; 
                break;
            }
        }
        cout << res << endl;
    }
    
    return 0;
}