알고리즘 스터디

[프로그래머스] 정렬 1. k번째 수

c++

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

using namespace std;

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

        answer.push_back(temp[commands[i][2] - 1]);
    }
    
    return answer;
}