BOJ5576: 콘테스트 (Bronze 2)

#include <stdio.h>
#include <iostream>
#include <algorithm>

using namespace std;

int main()
{
    int Wnum[10], Knum[10];
    for (int i = 0; i < 10; i++)
    {
        cin >> Wnum[i];
    }
    for (int i = 0; i < 10; i++)
    {
        cin >> Knum[i];
    }
    sort(Wnum, Wnum + 10);
    sort(Knum, Knum + 10);
    int Wmax = 0, Kmax = 0;
    for (int i = 9; i >= 7; i--)
    {
        Wmax += Wnum[i];
        Kmax += Knum[i];
    }
    cout << Wmax << " " << Kmax;
}