1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include <string>
#include <vector>
#include <algorithm>
#include <iostream>
using namespace std;

vector<int> solution(vector<int> array, vector<vector<int>> commands) {
    vector<int> answer,val;
    int num =(int)commands.size();
    for(int j=0;j<num;j++){
        val.clear();
    for(int i=commands[j][0]-1 ; i<commands[j][1];i++){
        val.push_back(array[i]);
    }
    sort(val.begin(),val.end());
        cout << commands[j][2]-1;
    answer.push_back(val[commands[j][2]-1]);
    
    } //for j
    return answer;
}