hdu3183 A Magic Lamp
来源:互联网 发布:昭大网络教育 编辑:程序博客网 时间:2024/06/05 07:28
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
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 ;}
0 0
- HDU3183 A Magic Lamp
- hdu3183 A Magic Lamp
- HDU3183 A Magic Lamp
- HDU3183-A Magic Lamp
- HDU3183 A Magic Lamp
- HDU3183 A Magic Lamp(线段树)
- hdu3183 A Magic Lamp(RMQ)
- HDU3183 A Magic Lamp(RMQ)
- HDU3183 A Magic Lamp (RMQ & ST)
- hdu3183—A Magic Lamp(RMQ,贪心)
- hdu3183——A Magic Lamp(RMQ)
- HDU3183 A Magic Lamp —— 贪心(单调队列优化)/ RMQ / 线段树
- A Magic Lamp HDU
- A Magic Lamp HDU
- hdu 3183 A Magic Lamp
- HDU 1811 A Magic Lamp
- hdu 3183 A Magic Lamp
- hdu 3183 A Magic Lamp
- Android Studio分模块自动化构建实战
- 架构师速成5-小学
- JavaWeb系列之十三(jdbc事务与连接池)
- 对象与函数参数
- POJ 3176 Cow Bowling
- hdu3183 A Magic Lamp
- Android onTouchEvent和setOnTouchListener中onTouch的区别
- 类个对象
- 两个链表的第一个公共结点
- Meteor 开发环境的搭建--webStorm安装
- onPrepareOptionsMenu 和onCreateOptionsMenu 的区别
- 胜者树和败者树的图解
- JS闭包详解
- ActiveMQ学习笔记(1)——JMS的概念