Submission #1586120

---

Source Code Expand

#include <bits/stdc++.h>

#define REP(i, n) for(int i = 0; i < (int)(n); ++i)
#define FOR(i, m, n) for(int i = (m); i < (int)(n); ++i)
#define INF 2000000000

#ifdef LOCAL
  #define eprintf(...) fprintf(stdout, __VA_ARGS__)
#else
  #define eprintf(...) 0
#endif

using namespace std;

typedef long long LL;
typedef unsigned long long ULL;
typedef unsigned int uint;

int ctoi(char c) {
  return c - '0';
}

template <class C>
void printContainer(C &container, const char *delim=",") {
  for(const auto &e : container) {
    std::cout << e << delim;
  }
  std::cout << "\n";
}

int main() {
  /*
  vector<int> ages(3);
  REP(i, 3) {
    cin >> ages[i];
  }
  sort(ages.begin(), ages.end());
  cout << ages[1] << endl;
  return 0;
  */

  /*
  int a, b, c, k, s, t;
  scanf("%d %d %d %d\n%d %d", &a, &b, &c, &k, &s, &t);
  eprintf("%d %d %d %d %d %d\n", a, b, c, k, s, t);
  int num = s + t;
  int sum = a * s + b * t;
  if(num >= k) {
    sum -= c * num;
  }
  printf("%d\n", sum);
  return 0;
  */

  string str;
  int n;
  //string str2;
  cin >> str;
  cin >> n;
  vector<string> names;
  REP(i, str.size()) {
    REP(j, str.size()) {
      string name(2, '0');
      name[0] = str[i];
      name[1] = str[j];
      names.push_back(name);
    }
  }
  sort(names.begin(), names.end());
  //printContainer(names);
  cout << names[n-1] << endl;

  return 0;
}

Submission Info

Judge Result