[Level 1, C++] K번째수

잘라서 넣는 방법만 알면 쉽게 풀 수 있었다.

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

vector<int> solution(vector<int> array, vector<vector<int>> commands) {
    vector<int> answer;
    for(int i = 0; i < commands.size(); i++) {
        vector<int> copy;
        copy.assign(array.begin() + commands[i][0] - 1, array.begin() + commands[i][1]);
        sort(copy.begin(), copy.end());
        answer.push_back(copy[commands[i][2] - 1]);
    }
    return answer;
}