fzu 2111 Min Number

 

http://acm.fzu.edu.cn/problem.php?pid=2111

 Problem 2111 Min Number

Accept: 572    Submit: 1106
Time Limit: 1000 mSec    Memory Limit : 32768 KB

 Problem Description

Now you are given one non-negative integer n in 10-base notation, it will only contain digits ('0'-'9'). You are allowed to choose 2 integers i and j, such that: i!=j, 1≤i<j≤|n|, here |n| means the length of n’s 10-base notation. Then we can swap n[i] and n[j].

For example, n=9012, we choose i=1, j=3, then we swap n[1] and n[3], then we get 1092, which is smaller than the original n.

Now you are allowed to operate at most M times, so what is the smallest number you can get after the operation(s)?

Please note that in this problem, leading zero is not allowed!

 Input

The first line of the input contains an integer T (T≤100), indicating the number of test cases.

Then T cases, for any case, only 2 integers n and M (0≤n<10^1000, 0≤M≤100) in a single line.

 Output

For each test case, output the minimum number we can get after no more than M operations.

 Sample Input

3

9012 0

9012 1

9012 2

 Sample Output

9012

1092

1029

 

分析：

 

由于数字较大10^100 , 所以考虑字符串解决，只需判断是否为首字符，是的话和后面的最小的靠后的非‘0’字符交换，否的话和后面的最小的字符交换即可。

 

AC代码：

#include <stdio.h>
#include <iostream>
#include <stdlib.h>
#include <algorithm>
#include <string.h>
#include <string>
#include <math.h>
#include <map>
#include <set>
#include <vector>
#include <stack>
#include <queue>

using namespace std;

const int INF = 0x3f3f3f3f;
const int MAX = 100 + 10;
const double eps = 1e-7;
const double PI = acos(-1.0);

char str[MAX];
int len;

int judge(int n)
{
    int temp = n , i;
    if(n == 0)
    {
        char min = str[n];
        for(i = 1;i < len;i ++)
        {
            if(str[i] != '0' && str[i] <= min)
            {
                min = str[i];
                temp = i;
            }
        }
    }
    else
    {
        char min = str[n];
        for(i = n + 1;i < len ;i ++)
        {
            if(str[i] <= min)
            {
                min = str[i];
                temp = i;
            }
        }
    }
    return temp;
}

int main()
{
    int T , n;
    scanf("%d",&T);
    while(T --)
    {
        scanf("%s %d",str , &n);
        len = strlen(str);
        int i = 0;
        while(n --)
        {
            int ji = judge(i);
            if(ji == i)
            {
                n ++;
                i ++;
            }
            else
            {
                str[i] = (str[ji] ^ str[i] ^ (str[ji] = str[i]));
                i ++;
            }
            if(i == len)
                break;
        }
        for(i = 0;i < len ;i ++)
            printf("%c",str[i]);
        puts("");
    }
    return 0;
}