백준 9076 c++

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

using namespace std;

void input_data(vector<vector<int>>& test_case)
{
	vector<int> temp;
	int T;
	int i, j;
	int N;

	cin >> T;
	for (i = 0; i < T; i++)
	{
		vector<int> temp;
		
		for (j = 0; j < 5; j++)
		{
			cin >> N;
			temp.push_back(N);
		}
		sort(temp.begin(), temp.end());
		test_case.push_back(temp);
	}

	/*for (i = 0; i < T; i++)
	{
		for (j = 0; j < 5; j++)
		{
			cout << test_case[i][j] << " ";
		}
		cout << "\n";
	}*/

	return;
}

void find_answer(vector<vector<int>>& test_case)
{
	int i, total, j;

	for (i = 0; i < test_case.size(); i++)
	{
		total = 0;
		if (test_case[i][test_case[i].size() - 2] - test_case[i][1] >= 4)
		{
			cout << "KIN\n";
			continue;
		}
		for (j = 1; j < test_case[i].size() - 1; j++)
		{
			total += test_case[i][j];
		}
		cout << total << "\n";
	}

	return;
}

void test_case()
{
	vector<vector<int>> test_case;

	input_data(test_case);
	find_answer(test_case);

	return;
}

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

	test_case();

	return 0;
}