[프로그래머스][Level1] K번째수 c++

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

프로그래머스

 

풀이과정

v 벡터에 인덱스 자른 값을 넣고 정렬한다.  
그리고 answer 벡터에는 k번째 있는 수를 넣는다.

 

풀이1

#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> v;
        for(int j = commands[i][0] - 1; j < commands[i][1]; j++){
            v.push_back(array[j]);
        }
        sort(v.begin(), v.end());
        answer.push_back(v[commands[i][2] - 1]);
    }
    return answer;
}

 

풀이2

#include <string>
#include <vector>

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> v;
        for(int j = commands[i][0] - 1; j < commands[i][1]; j++){
            v.push_back(array[j]);
        }
        // sort 함수 오름차순 구현
        for(int j = 0; j < v.size(); j++){
            for(int k = 0; k < v.size(); k++){
                if(v[j] < v[k]){
                    int temp = v[j];
                    v[j] = v[k];
                    v[k] = temp;
                }
            }
        }
        answer.push_back(v[commands[i][2] - 1]);
    }

    return answer;
}