프로그래머스 120835 진료순서 정하기

1 개요[ | ]

프로그래머스 120835 진료순서 정하기

2 C++[ | ]

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

using namespace std;

vector<int> solution(vector<int> emergency) {
    vector<int> v (emergency.begin(), emergency.end());
    sort(v.begin(), v.end(), greater<int>());
    vector<int> answer;
    for(int& e: emergency) {
        auto it = find(v.begin(), v.end(), e);
        answer.push_back(it-v.begin()+1);
    }
    return answer;
}
#include <string>
#include <vector>
#include <algorithm>

using namespace std;

vector<int> solution(vector<int> emergency) {
    vector<int> v (emergency.begin(), emergency.end());
    sort(v.begin(), v.end(), greater<int>());
    vector<int> answer;
    for(int& e: emergency) {
        answer.push_back(distance(v.begin(), find(v.begin(), v.end(), e))+1);
    }
    return answer;
}