Submission #4075526


Source Code Expand

#include <iostream>
#include <string>

using namespace std;

int N, K;
string S;

string search(string s, int k){
    if(k==0 || s == "" || s.size()==1) return s;
    else{
        int min_id = 0;
        char buff = s[0];
        for(int i = 1; i < s.size(); i++){
            if (buff > s[i]){
                min_id = i;
                buff = s[i];
            }
        }
        if(min_id != 0)
            swap(s[0],s[min_id]);
        char head = s[0];
        s.erase(s.begin());
        if(min_id==0) return head + search(s, k); //入れ替えが起こっていない
        else return head + search(s, k-1);
    }
}

void solve(){
    cout << search(S,K) << endl;
}

int main(){
    cin >> N >> K >> S;

    solve();
}

Submission Info

Submission Time
Task C - 辞書式順序ふたたび
User Ricky_Ban
Language C++14 (GCC 5.4.1)
Score 0
Code Size 767 Byte
Status WA
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name All
Score / Max Score 0 / 100
Status
AC × 17
WA × 41
Set Name Test Cases
All hand_1_0.txt, hand_1_1.txt, hand_1_2.txt, hand_1_3.txt, hand_1_4.txt, hand_1_5.txt, hand_1_6.txt, hand_1_7.txt, hand_1_8.txt, hand_2_0.txt, hand_2_1.txt, hand_2_10.txt, hand_2_2.txt, hand_2_3.txt, hand_2_4.txt, hand_2_5.txt, hand_2_6.txt, hand_2_7.txt, hand_2_8.txt, hand_2_9.txt, hand_3_2.txt, hand_3_3.txt, hand_3_4.txt, hand_3_5.txt, hand_3_6.txt, hand_4_2.txt, hand_4_3.txt, hand_4_4.txt, hand_4_5.txt, hand_4_6.txt, random_1.txt, random_10.txt, random_11.txt, random_12.txt, random_13.txt, random_14.txt, random_15.txt, random_2.txt, random_3.txt, random_4.txt, random_5.txt, random_6.txt, random_7.txt, random_8.txt, random_9.txt, sample_1.txt, sample_2.txt, sample_3.txt, sample_4.txt, small_1.txt, small_2.txt, small_3.txt, small_4.txt, small_5.txt, small_6.txt, small_7.txt, small_8.txt, small_9.txt
Case Name Status Exec Time Memory
hand_1_0.txt AC 1 ms 256 KB
hand_1_1.txt WA 1 ms 256 KB
hand_1_2.txt WA 1 ms 256 KB
hand_1_3.txt WA 1 ms 256 KB
hand_1_4.txt WA 1 ms 256 KB
hand_1_5.txt WA 1 ms 256 KB
hand_1_6.txt WA 1 ms 256 KB
hand_1_7.txt AC 1 ms 256 KB
hand_1_8.txt AC 1 ms 256 KB
hand_2_0.txt AC 1 ms 256 KB
hand_2_1.txt WA 1 ms 256 KB
hand_2_10.txt AC 1 ms 256 KB
hand_2_2.txt WA 1 ms 256 KB
hand_2_3.txt WA 1 ms 256 KB
hand_2_4.txt WA 1 ms 256 KB
hand_2_5.txt WA 1 ms 256 KB
hand_2_6.txt WA 1 ms 256 KB
hand_2_7.txt WA 1 ms 256 KB
hand_2_8.txt AC 1 ms 256 KB
hand_2_9.txt AC 1 ms 256 KB
hand_3_2.txt WA 1 ms 256 KB
hand_3_3.txt WA 1 ms 256 KB
hand_3_4.txt WA 1 ms 256 KB
hand_3_5.txt WA 1 ms 256 KB
hand_3_6.txt WA 1 ms 256 KB
hand_4_2.txt WA 1 ms 256 KB
hand_4_3.txt WA 1 ms 256 KB
hand_4_4.txt WA 1 ms 256 KB
hand_4_5.txt WA 1 ms 256 KB
hand_4_6.txt WA 1 ms 256 KB
random_1.txt WA 1 ms 256 KB
random_10.txt WA 1 ms 256 KB
random_11.txt WA 1 ms 256 KB
random_12.txt WA 1 ms 256 KB
random_13.txt WA 1 ms 256 KB
random_14.txt WA 1 ms 256 KB
random_15.txt WA 1 ms 256 KB
random_2.txt WA 1 ms 256 KB
random_3.txt WA 1 ms 256 KB
random_4.txt WA 1 ms 256 KB
random_5.txt AC 1 ms 256 KB
random_6.txt WA 1 ms 256 KB
random_7.txt WA 1 ms 256 KB
random_8.txt WA 1 ms 256 KB
random_9.txt WA 1 ms 256 KB
sample_1.txt AC 1 ms 256 KB
sample_2.txt WA 1 ms 256 KB
sample_3.txt AC 1 ms 256 KB
sample_4.txt WA 1 ms 256 KB
small_1.txt AC 1 ms 256 KB
small_2.txt AC 1 ms 256 KB
small_3.txt AC 1 ms 256 KB
small_4.txt WA 1 ms 256 KB
small_5.txt AC 1 ms 256 KB
small_6.txt AC 1 ms 256 KB
small_7.txt WA 1 ms 256 KB
small_8.txt AC 1 ms 256 KB
small_9.txt AC 1 ms 256 KB