[Programmers] (탐욕법(Greedy)) Lv 2. 큰 수 만들기

https://school.programmers.co.kr/learn/courses/30/lessons/42883

프로그래머스

 

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

using namespace std;

string solution(string number, int k) {
    string answer = "";
    int start = 0, cnt = number.length() - k;

    while (answer.length() != cnt)
    {
        // end에서 구해야 할 남은 개수만큼 뺀 영역까지 최대 값 도출
        auto temp = max_element(number.begin() + start, number.end() - cnt + answer.length() + 1);

        // start를 새롭게 갱신
        answer += *temp, start = temp - number.begin() + 1;
    }
    
    return answer;
}

GitHub : https://github.com/developeSHG/Algorithm-Baekjoon_Programmers/commit/98370c48d4252f379d0cce3c24a42d139447fefb

[level 2] Title: 큰 수 만들기, Time: 0.01 ms, Memory: 4.14 MB -BaekjoonHub · developeSHG/Algorithm-Baekjoon_Programmers@98