레이팅 미적용설명
\(4^{th}\) round, February \(18^{th}\), 2012
Mirko and Slavko are bored at math class again so they came up with new game. Mirko writes down an
N digit number, and Slavko’s task is to obtain the largest possible number after having removed
exactly K digits.
Help him do that!
제약
In test cases worth 50% of total points, N will not exceed 1000.
입력 형식
The first line of input contains integers N and K (\(1 \le K < N \le 500\,000\)).
The following line contains N digit number. This number starts with non-zero digit.
출력 형식
The first and only line of output should contain the largest possible number Slavko can obtain by
removing K digits from the given number.
예제 1
입력
4 2
1924출력
94예제 2
입력
7 3
1231234출력
3234예제 3
입력
10 4
4177252841출력
775841문제 정보