[레벨 1] 로또의 최고 순위와 최저 순위

#include <string>
#include <vector>
#include <algorithm>
using namespace std;

vector<int> solution(vector<int> lottos, vector<int> win_nums) {
    vector<int> answer;
    answer.reserve(2);
    int high = 0, low = 0, cor = 0, cnt = 0;
    //sort(lottos.begin(), lottos.end());
    //sort(win_nums.begin(), win_nums.end());
    for (int i = 0; i < 6; ++i)
    {
        if (lottos[i] == 0)
            ++cnt;
        for (int j = 0; j < 6; ++j)
        {
            if (lottos[i] == win_nums[j])
                ++cor;
        }
    }
    low = cor;
    high = cor + cnt;
    switch (high)
    {
    case 6:
        answer.push_back(1);
        break;
    case 5:
        answer.push_back(2);
        break;
    case 4:
        answer.push_back(3);
        break;
    case 3:
        answer.push_back(4);
        break;
    case 2:
        answer.push_back(5);
        break;
    default:
        answer.push_back(6);
        break;
    }
    switch (low)
    {
    case 6:
        answer.push_back(1);
        break;
    case 5:
        answer.push_back(2);
        break;
    case 4:
        answer.push_back(3);
        break;
    case 3:
        answer.push_back(4);
        break;
    case 2:
        answer.push_back(5);
        break;
    default:
        answer.push_back(6);
        break;
    }

    return answer;
}