python | beats 98% | simple
```\nif len(nums)==k:\n            return "0"\n        stack=[]\n        count=0\n        stack.append(nums[0])\n        for i in range(1,len(nums)):\n         
```\nif len(nums)==k:\n            return "0"\n        stack=[]\n        count=0\n        stack.append(nums[0])\n        for i in range(1,len(nums)):\n            while(stack and stack[-1]>nums[i]):\n                stack.pop()\n                count+=1\n                if count==k:\n                    if stack:\n                        return str(int("".join(stack)))+"".join(nums[i:])\n                    else:\n                        return str(int("".join(nums[i:])))\n            stack.append(nums[i])\n        while (stack and count<k):\n            stack.pop()\n            count+=1\n        return str(int("".join(stack)))
['Stack', 'Greedy', 'Python', 'Python3']