codeforces 435B Pasha Maximizes

                                                  Pasha Maximizes

貪心：找到利用當前k能夠得到的使當前位置的數字最大的情況。。

                      Time Limit:1000MS    Memory Limit:262144KB    64bit IO Format:%I64d & %I64u

Description

  Pasha has a positive integer a without leading zeroes. Today he decided that the number is too small and he should make it larger. Unfortunately, the only operation   Pasha can do is to swap two adjacent decimal digits of the integer.

  Help Pasha count the maximum number he can get if he has the time to make at most k swaps.

Input

  The single line contains two integers a and k(1 ≤ a ≤ 10¹⁸; 0 ≤ k ≤ 100).

Output

  Print the maximum number that Pasha can get if he makes at most k swaps.

Sample Input

Input

1990 1

Output

9190

Input

300 0

Output

300

Input

1034 2

Output

3104

Input

9090000078001234 6

Output

9907000008001234

#include <iostream>
#include<cstdio>
#include<cstring>
using namespace std;
char a[20];
int aa[20];
int main()
{
    int k;
    while(scanf("%s%d",a,&k)!=EOF)
    {
        int i;
        int len=strlen(a);
        memset(aa,0,sizeof(a));
        for(i=1;i<=len;i++) aa[i]=a[i-1]-'0';
        int f=1;
        while(k>0)
        {
            int max=-1;
            int flag=0;
            for(i=f;i<=f+k&&i<=len;i++)
            {
                if(max<aa[i]) {max=aa[i];flag=i;}
            }
            for(i=flag;i>f;i--)
            {
                swap(aa[i],aa[i-1]);
            }
            k=k-flag+f;
            f++;
            if(f>len) break;
        }
        for(i=1;i<=len;i++) printf("%d",aa[i]);
        printf("\n");
    }
    return 0;
}