Submission #1366619

---

Source Code Expand

#include <iostream>
#include <utility>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;

int main() {
  int N, K; cin >> N >> K;
  vector<char> S(N);
  for ( auto& s : S ) cin >> s;
  for ( int i = 0; i < K; i++ ) {
    auto itr = min_element(S.begin() + i, S.end());
    int min = distance(S.begin(), itr);

    swap(S[i], S[min]);
  }
  for ( auto s : S ) cout << s; cout << "\n";

  return 0;
}

Submission Info

Judge Result