프로그래머스 / 정렬 / K번째 수

 

https://programmers.co.kr/learn/courses/30/lessons/42748

프로그래머스

#include <string>
#include <vector>
#include <algorithm>
 
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++)
    {
        int startCut = commands[i][0] - 1;
        int endCut = commands[i][1];
        int findLoc = commands[i][2] - 1;
        int differ = endCut - startCut;
 
        for (int j = 0; j < differ; j++)
        {
            temp.push_back(array[startCut + j]);
        }
        sort(temp.begin(), temp.end());
        answer.push_back(temp[findLoc]);
        temp.clear();
    }
 
    return answer;
}