hdu3183 A Magic Lamp

最新推荐文章于 2021-02-15 15:09:05 发布

fzw_captain

最新推荐文章于 2021-02-15 15:09:05 发布

阅读量684

点赞数

CC 4.0 BY-SA版权

分类专栏： ACM-贪心

本文链接：https://blog.csdn.net/fzw_captain/article/details/46572941

ACM-贪心专栏收录该内容

3 篇文章

订阅专栏

本文介绍了一个有趣的数学问题：如何从一个整数中删除指定数量的数字以获得尽可能小的新整数，并提供了一段C++代码实现，通过贪心算法解决了这一问题。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

A Magic Lamp

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 2030 Accepted Submission(s): 811

Problem Description
Kiki likes traveling. One day she finds a magic lamp, unfortunately the genie in the lamp is not so kind. Kiki must answer a question, and then the genie will realize one of her dreams.
The question is: give you an integer, you are allowed to delete exactly m digits. The left digits will form a new integer. You should make it minimum.
You are not allowed to change the order of the digits. Now can you help Kiki to realize her dream?

Input
There are several test cases.
Each test case will contain an integer you are given (which may at most contains 1000 digits.) and the integer m (if the integer contains n digits, m will not bigger then n). The given integer will not contain leading zero.

Output
For each case, output the minimum result you can get in one line.
If the result contains leading zero, ignore it.

Sample Input
178543 4
1000001 1
100001 2
12345 2
54321 2

Sample Output
13
1
0
123

321

贪心

#include <iostream>
#include <cstdio>
#include <string>
using namespace std;

int main()   {

    string s ;
    int m ;
    while( cin >> s >> m )  {
        int len = s.size()  ;
        int ll = len - m ;
        int l = len - ll ;
        int flag = 0 ;
        int p = 0 ;
        while(ll--) {
            char minn = s[p] ;
            for( int i = p + 1; i <= l  ; ++i ) {
                if( s[i] < minn ) {
                    minn = s[i] ;
                    p = i ;
                }
            }
            if( flag || minn != '0'  ) cout << minn , flag = 1 ;
            ++l ,++p ;
        }
        if( !flag )  cout << 0  ;
        cout << endl ;
    }
    return 0 ;
}