{"trustable":true,"sections":[{"title":"Description","value":{"format":"MD","content":"Input a positive integer $n$ with high precision (no more than $250$ digits), remove any $k$ digits from it, and the remaining digits will form a new non-negative integer in the original order. Write a program to find a solution for the given $n$ and $k$, so that the new number formed by the remaining digits is minimized."}},{"title":"Input","value":{"format":"MD","content":"Input two lines of positive integers.\n\nThe first line inputs a positive integer $n$ with high precision.\n\nThe second line inputs a positive integer $k$, indicating the number of digits to be removed."}},{"title":"Output","value":{"format":"MD","content":"Output an integer, the minimum number left in the end."}},{"title":"Sample 1","value":{"format":"MD","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e175438 \n4\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e13\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e"}},{"title":"Hint","value":{"format":"MD","content":"Use $\\operatorname{len}(n)$ to represent the **number of digits** in $n$, ensuring $1 \\leq k \u003c \\operatorname{len}(n) \\leq 250$."}}]}