CSP20231210-1 仓库规划 C/C++满分 暴力

C/C++:

暴力即可

#include<bits/stdc++.h>
using namespace std;
int n,m;
bool isFound = true;
int main(){
	cin >> n >> m;
	int nums[n+1][m];
	memset(nums,0,sizeof nums);
	for(int i = 1;i<=n;i++){
		for(int j = 0;j<m;j++){
			cin >> nums[i][j];
		}
	}
	for(int i = 1;i<=n;i++){
		for(int j =1;j<=n;j++){
			if(j==i){
				continue;
			}
			isFound = true;
			for(int k = 0;k<m;k++){
				if(nums[i][k]>=nums[j][k]){
					isFound = false;
					break;
				}
			}
			if(isFound){
				cout << j << endl;
				break;
			}
		}
		if(!isFound){
			cout << 0 << endl;
		}
	}	
}