[프로그래머스 고득점kit] 정렬_k번째수(c++)

https://school.programmers.co.kr/learn/courses/30/lessons/42748?language=cpp 

프로그래머스

#include <string>
#include <vector>
#include <algorithm>

using namespace std;

vector<int> solution(vector<int> array, vector<vector<int>> commands) {
    vector<int> answer;
    
    // commands [startidx + 1, endidx + 1, targetidx + 1]
    for (int i = 0; i < commands.size(); i++)
    {
        int start_idx = commands[i][0] - 1, end_idx = commands[i][1] - 1, target_idx = commands[i][2] - 1;
        vector<int> v(end_idx - start_idx + 1);
        for (int j = 0; j <= end_idx - start_idx; j++)
            v[j] = array[j + start_idx];
        sort(v.begin(), v.end());
        answer.push_back(v[target_idx]);
    }
    return answer;
}

easy