MAX_NUM - finding maximum possible number
Given a number n, Find out what max possible number you can make by deleting exactly k digits.
T : no of test cases <= 10^3
1 <= no of digits in n <= 10^5. (n might contain leading zeros)
0 <= k <= n
if value of n is equal to k. then just print a new line.
T: no of test cases
T line follow
every line has
n , k
max possible number
8756 2 Output: 23
Note that left to right order should be maintained. As in the example given answer is 23 not 32.
@praveen123:hi! can u pls tell me where i m lacking in my code 21889739
I am getting TLE, if I use segment tree, for finding out next maximum character.
how can i avoid tle? (15041280)
@praveen123 lots of wa can u pls provide some test cases where my solution fails or u can look into my code and tell the probable bugs... Thanks in advance :)
Last edit: 2015-04-26 07:53:47
submission id :13224845 why is it giving wrong answer
@praveen123: Hi! can u pls tell me where i m lacking in my code 12526342.
Last edit: 2014-08-30 11:02:30
Last edit: 2014-08-06 07:20:27