首页 > 代码库 > (贪心) hdu 3183

(贪心) hdu 3183

2024-11-22 18:36:01   202人阅读

A Magic Lamp

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


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 1100001 212345 254321 2
 

 

Sample Output
1310123321
 

 

Source
HDU 2009-11 Programming Contest
 

 

#include<iostream>#include<cstdio>#include<cstring>#include<string>#include<cstdlib>#include<algorithm>#include<cmath>using namespace  std;char s[10010];int n,len;void work(){      int temp=n;      while(temp--)      {            int i=0;            while(i<len-1&&s[i]<=s[i+1]) i++;            for(int j=i+1;j<len;j++)                  s[j-1]=s[j];      }}int main(){      while(scanf("%s%d",s,&n)!=EOF)      {            len=strlen(s);            if(n>=len)            {                  printf("0\n");                  continue;            }            work();            bool flag=false;            for(int i=0;i<len-n;i++)            {                  if(!flag&&(s[i]==‘0‘&&i!=len-n-1))                        continue;                  else                  {                        printf("%c",s[i]);                        flag=1;                  }            }            printf("\n");            memset(s,‘0‘,sizeof(s));      }      return 0;}

　　

(贪心) hdu 3183


联系
我们