백준 5533 c++

#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>

using namespace std;

void input_score( vector<vector<int>>& score)
{
	int i;
	int N;
	int first, second, third;

	cin >> N;
	for (i = 0; i < N; i++)
	{
		vector<int> temp;

		cin >> first >> second >> third;
		temp.push_back(first);
		temp.push_back(second);
		temp.push_back(third);
		score.push_back(temp);
	}

	return;
}

void find_answer(vector<vector<int>> &score)
{
	int i, j, k;
	bool is_unique;
	vector<int> answer(score.size(), 0);

	for (i = 0; i < 3; i++)
	{
		for (j = 0; j < score.size(); j++)
		{
			is_unique = true;
			for (k = 0; k < score.size(); k++)
			{
				if (score[k][i] == score[j][i] && k != j)
				{
					is_unique = false;
					break;
				}
			}
			if (is_unique)
			{
				answer[j] += score[j][i];
			}
		}
	}

	for (int num : answer)
	{
		cout << num << "\n";
	}


	return;
}

int main(void)
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);

	vector<vector<int>> score;
	
	input_score(score);
	find_answer(score);

	return 0;
}