zoukankan      html  css  js  c++  java
  • Codeforces 435B. 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>
    #include <algorithm>
    
    using namespace std;
    
    char str[200];
    int nt;
    
    int main()
    {
        long long int a;
        int k;
        cin>>a>>k;
        while(a)
        {
            str[nt++]=a%(10LL)+'0';
            a/=10LL;
        }
        for(int i=nt-1;i>=0&&k;i--)
        {
            int mark=-1,dist=-1;
            for(int j=i;j>=max(0,i-k);j--)
            {
                if(str[j]>str[mark])
                {
                    mark=j; dist=i-j;
                }
            }
            k-=dist;
            for(int j=mark;j<i;j++)
            {
                swap(str[j],str[j+1]);
            }
        }
        for(int i=nt-1;i>=0;i--)
        {
            cout<<str[i];
        }
        cout<<endl;
        return 0;
    }
    



  • 相关阅读:
    PLSQL13
    01.Spring引入
    验证码重构
    短信验证码登录思路
    记住我 token保存到数据库
    图形验证码及其重构
    个性化用户认证流程
    01.Spring Security初识,表单认证
    堆和栈的区别
    系统分析与设计第二次作业
  • 原文地址:https://www.cnblogs.com/mfrbuaa/p/5170034.html
Copyright © 2011-2022 走看看