[Programmers]_C++_Algorithm_데이터분석

이차원 벡터의 정렬 방법에 대해서 더 많이 공부해야함

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

using namespace std;

vector<vector<int>> solution(vector<vector<int>> data, string ext, int val_ext, string sort_by) {
    vector<vector<int>> answer;
    vector<string> list_ = {"code", "date", "maximum", "remain"};
    auto ext_value = find(list_.begin(), list_.end(), ext);
    int ext_idx = distance(list_.begin(), ext_value);
    auto sor_value = find(list_.begin(), list_.end(), sort_by);
    int sor_idx = distance(list_.begin(), sor_value);

    for (int i = 0; i < data.size(); i++){
        if(data[i][ext_idx] <= val_ext){
            answer.push_back(data[i]);
        }
    }
    
    sort(answer.begin(), answer.end(), [sor_idx](const vector<int>& a, const vector<int>& b) {
        return a[sor_idx] < b[sor_idx]; 
    });

    return answer;
}