problem solving
[프로그래머스]K번째수
Shinuk Yi
2020. 3. 6. 09:21
그저 지문을 따라서 풀면 되는 아주 쉬운 문제.
#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++) {
temp.clear();
for(int j = commands[i][0] - 1; j < commands[i][1]; j++) {
temp.push_back(array[j]);
}
sort(temp.begin(), temp.end());
answer.push_back(temp[commands[i][2] - 1]);
}
return answer;
}
|
cs |