백준 5800 c++

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

using namespace std;

void input_score(vector<int> &score)
{
	int i;
	int N, temp;

	cin >> N;
	for (i = 0; i < N; i++)
	{
		cin >> temp;
		score.push_back(temp);
	}

	return;
}

void find_answer(vector<int>& score, int trial)
{
	int i, largest_gap = 0, gap;
	sort(score.begin(), score.end());

	for (i = 0; i < score.size() - 1; i++)
	{
		gap = score[i + 1] - score[i];
		if (gap > largest_gap)
		{
			largest_gap = gap;
		}
	}
	cout << "Class " << trial << "\n";
	cout << "Max " << score.back() << 
		", Min " << score.front() << 
		", Largest gap " << largest_gap << "\n";

	return;
}

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

	int K;
	cin >> K;
	for (int i = 1; i <= K; i++)
	{
		vector<int> score;
		input_score(score);
		find_answer(score, i);
	}

	return 0;
}