【算法练习】CSP--202312-1--仓库规划

• 复习vector的使用

#include<iostream>
#include<vector>
using namespace std;

int n, m;

bool isUp(vector<int>a, vector<int>b)
{
	bool flag = 1;
	for (size_t i = 0; i < m; i++)
	{
		if (a[i] <= b[i]) return 0;
	}
	return 1;
}

int main() {
	cin >> n >> m;
	vector<vector<int>> vec(n, vector<int>(m));

	for (size_t i = 0; i < n; i++)
	{
		for (size_t j = 0; j < m; j++)
		{
			cin >> vec[i][j];
		}
	}

	for (size_t i = 0; i < n; i++)
	{
		bool notFind = 1;
		for (size_t j = 0; j < n; j++)
		{
			if (isUp(vec[j], vec[i]))
			{
				cout << j + 1 << endl;
				notFind = 0;
				break;
			}
		}
		if (notFind)
		{
			cout << "0\n";
		}
	}

	return 0;
	system("pause");
}