백준 5576 c++

쉬운 정렬문제이다

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

using namespace std;

void input_vector(vector<int>&W, vector<int>& K)
{
	int i, temp;

	for (i = 0; i < 10; i++)
	{
		cin >> temp;
		W.push_back(temp);
	}
	for (i = 0; i < 10; i++)
	{
		cin >> temp;
		K.push_back(temp);
	}

	return;
}

void find_answer(vector<int>& W, vector<int>& K)
{
	int sum_W = 0, sum_K = 0;
	int i, j;

	sort(W.begin(), W.end(), greater<>());
	sort(K.begin(), K.end(), greater<>());
	for (i = 0; i < 3; i++)
	{
		sum_W += W[i];
		sum_K += K[i];
	}
	cout << sum_W << " " << sum_K << "\n";

	return;
}

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

	vector<int> W;
	vector<int> K;

	input_vector(W, K);
	find_answer(W, K);

	return 0;
}