仓库规划
作者:
Change01
,
2024-03-24 00:26:20
,
所有人可见
,
阅读 3
#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
int n, m;
int a[1010][10];
int main()
{
cin >> n >> m;
for(int i = 1; i <= n; i ++ )
for(int j = 1; j <= m; j ++)
cin >> a[i][j];
for(int i = 1; i <= n; i ++ ) //第i行
{
bool flag = true;
for(int j = 1; j <= n; j ++ ) //第j行
{
if(i == j) continue;
flag = true;
for(int k = 1; k <= m; k++ ) //第k列
{
if(a[i][k] >= a[j][k])
{
flag = false;
break;
}
}
if(flag)
{
cout << j << endl;
break;
}
}
if(!flag) cout << 0 << endl;
}
return 0;
}