zoukankan      html  css  js  c++  java
  • Codeforces Round #249 (Div. 2) B. Pasha Maximizes

    B. Pasha Maximizes
    time limit per test
    1 second
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    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 ≤ 1018; 0 ≤ k ≤ 100).

    Output

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

    Sample test(s)
    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 str[20];
    int k,l;

    int main()
    {
       int pos,i,j,t; char c;
       scanf("%s",str+1);
       scanf("%d",&k);
       l=strlen(str+1);
       pos=1;
       while(k>0&&pos<l)
       {
             for(i=pos+1,j=pos;i<=l&&i<=pos+k;i++)
                 if(str[i]>str[j]) j=i;
             //cout<<j<<' '<<i<<endl;
             c=str[j];
             for(i=j;i>pos;i--) str[i]=str[i-1];
             str[pos]=c;
             //cout<<str+1<<endl;
             k-=(j-pos);
             pos++;
       }
       printf("%s",str+1);
       return 0;
    }
  • 相关阅读:
    HTML5与HTML的区别
    0918练习整理
    0904 未来展望
    ajax弹出窗口
    AjAX请求后台,无刷新更新页面
    Jquery通过Ajax方式来提交Form表单
    php的socket通信
    次短路[SPFA]
    [Usaco2008 Open]Roads Around The Farm分岔路口[水题]
    [Usaco2008 Nov]Guarding the Farm 保卫牧场[DFS]
  • 原文地址:https://www.cnblogs.com/crazyacking/p/3762020.html
Copyright © 2011-2022 走看看