Type: Default 1000ms 256MiB

删数问题F603

You cannot submit for this problem because the contest is ended. You can click "Open in Problem Set" to view this problem in normal mode.

Description

输入一个高精度的正整数n,去掉其中任意s个数字后剩下的数字按原左右次序组成一个新的正整数。编程对给定的n和s,寻找一种方案使得剩下的数字组成的新数最小。

输出新的正整数。(n不超过240位)

输入数据均不需判错。

Input Format

输入两行包含两个整数n和s

Output Format

最后剩下的最小数

175438
4
13

2024-12-15贪心训练

Not Attended
Status
Done
Rule
XCPC
Problem
8
Start at
2024-12-15 13:30
End at
2024-12-15 16:30
Duration
3 hour(s)
Host
Partic.
6