435B codeforces - Pasha Maximizes

435B codeforces - Pasha Maximizes

http://codeforces.com/contest/435/problem/B

Solution in C++

#include <bits/stdc++.h>
using namespace std;

typedef long long int lli;
#define pii pair<int,int>

string n;
int k;

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    cin>>n>>k;
    for(int i=0;i<n.size()-1;i++)
    {
        if(!k)break;
        char bst=n[i];
        int tr=k,num=-1;
        for(int o=i+1;o<n.size();o++)
        {
            if(!tr)break;
            tr--;
            if(n[o]>bst)
            {
                bst=n[o];
                num=o;
            }
        }
        if(num!=-1)
        {
            for(int o=num;o>i;o--)swap(n[o],n[o-1]);
            k-=num-i;
        }
    }
    cout<<n;
    return 0;
}

Useful Links:

August Surprise - Coolforces T-shirts - own your t-shirt now!

Share on Google Plus

About Mohamed Sobhi

My name is Mo.Sobhy ,I study at School excelling high school in Ain Shams ,Cairo
My hobbies is programming ,and web development ,playing chess and writing horror stories.