풀스택 개발자 2021. 3. 12. 00:35
#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> test;
        for (int j = commands[i][0] - 1; j < commands[i][1]; j++) test.push_back(array[j]);
        sort(test.begin(), test.end());
        answer.push_back(test[commands[i][2] - 1]);
    }
    return answer;
}