Submission #175230

---

Source Code Expand

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <algorithm>

using namespace std;

#define rep(i,j) REP((i), 0, (j))
#define REP(i,j,k) for(int i=(j);(i)<(k);++i)
#define between(a,x,b) ((a)<=(x)&&(x)<=(b))
#define F first
#define S second
#define INF 1 << 30

int N, K;
string S;

int cnt(string a, string b){
  int res = 0;
  rep(i, a.length()) if(a[i] != b[i]) res++;
  return res;
}

/*string move(string a, string b, int p){
  REP(i, p, a.length()){
    for(int j = a.length()-1; j > i; j--){
      if(a[i] == b[j]){
	char tmp = a[i];
	a[i] = a[j];
	a[j] = tmp;
	break;
      }
    }
  }
  return a;
}*/

string move(string a, string b, int p){

  REP(i, p, a.length()){
    for(int j = p; j < a.length(); j++){
      if(a[i] == b[j]){
        char tmp = a[i];
        a[i] = a[j];
        a[j] = tmp;
      }
    }
  }
  return a;
}

int main(){
  scanf("%d%d", &N, &K);
  cin >> S;
  string T = S;
  int i = 0;
  vector<string>rank;
  
  while(true){
    string fork = T;
    int cmin = i;
    REP(j, i, N) if(T[cmin] >= T[j]) cmin = j;
    if(cmin != i){
      char tmp = T[cmin];
      T[cmin] = T[i];
      T[i] = tmp;
    }

    T = move(T, S, i+1);
    rank.push_back(T);
    i++;
    if(i >= N) break;
  }

  sort(rank.begin(), rank.end());
  string res = "zzzzzzz";
  rep(i, rank.size()){
    if(cnt(rank[i], S) <= K && res > rank[i]){
      res = rank[i];

    }
  }
  cout << res << endl;
  return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:61:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]

Judge Result