Submission #3564264

---

Source Code Expand

#define _USE_MATH_DEFINES    
#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <string>
#include <vector>
#include <utility>
#include <complex>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <deque>
#include <tuple>
#include <bitset>
#include <limits>
#include <algorithm>
#include <array>
#include <random>
#include <complex>
#include <regex>
using namespace std;
typedef long double ld;
typedef long long ll;
typedef vector<int> vint;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
#define quickIO()   {cin.tie(0);    cout.sync_with_stdio(false);}
#define rep(i,n)    for(ll i=0; i<(ll)n; i++)
#define mp(a,b) make_pair(a,b)
#define pb push_back
#define fcout cout << fixed << setprecision(10) 
const ll inf = 1e18;
const ll mod = 1e9 +7;
     
ld sqrtld(ld x){
    ld left = 0, right = x;
    rep(i, 100){
        ld mid = (left + right)/2;
        if (mid*mid <= x)   left =mid;
        else    right = mid;
    }
    return left;
}

ll gcd(ll a, ll b){
    if(b>a){
        ll c =b; b=a;   a=c;
    }
    ll d = a%b;
    if(d==0){
        return b;
    }else if(d==1){
        return 1;
    }else{
        gcd(b,d);
    }
}


ll cul(ll n){
    return (n-1)*n/2;
}


int cou[26];
int main (){
    string s; int k ;
    cin >> s >> k;

    rep(i,s.size()){
        int a = s[i] -'a';
        cou[a]++;
    }

    if(s.size()-k<= cou[0]){
        rep(i,s.size()-k){
            cout << "a";
        }
        cout << endl;
        return 0;
    }
    
    int a = 30;
    int bs;
    rep(i,s.size()){
        int b=0;
        if(s[i] != 'a'){
            b = s[i] -'a';
            if(a>b) bs = i;
            a = min(a,b);
        }
    }
    string ans;
    int co=0;
    rep(i,bs){
        ans += "a";
        if(s[i] == 'a'){
            co++;
        }
    };

    for(int i=bs; i<s.size(); i++){
        ans += s[i];
    }

    rep(i, k-bs+co){
        ans = 'a' + ans;
    }
    cout << ans << endl;
    return 0;
}

Submission Info

Judge Result