Language: C++

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
int main(){
    string s;
    cin >> s;
    int n;
    cin >> n;
    vector<string> vs;
    for(char j = 'a'; j <= 'z'; j++){
        string tmp = "";
        for(int k = 0; k < n; k++){
            tmp += j;
        }
        int seq = (int)s.find(tmp);
        if(seq>=0){seq=1;}
        for(int i = 0; i < s.size(); i++){

            if(s[i] == j){
                int cnt = 0;
                if(seq){
                for(int k = 0; k < min(s.size()-i,10); k++){
                    auto itr = find(vs.begin(), vs.end(), s.substr(i,k+1));
                    if( itr == vs.end() ) {
                        cnt++;
                        vs.push_back(s.substr(i,k+1));
                    }
                    if(cnt>=n){break;}
                }}
                else{
                for(int k = 0; k < s.size()-i; k++){
                    auto itr = find(vs.begin(), vs.end(), s.substr(i,k+1));
                    if( itr == vs.end() ) {
                        cnt++;
                        vs.push_back(s.substr(i,k+1));
                    }
                    if(cnt>=n){break;}
                }}
            }
        }
        if(vs.size()>=n){break;}
    }
    sort(vs.begin(),vs.end());


    cout << vs[n-1] << endl;




    return 0;

}


Compiler output:
a.cc: In function 'int main()':
a.cc:23:39: error: no matching function for call to 'min(std::__cxx11::basic_string<char>::size_type, int)'
   23 |                 for(int k = 0; k < min(s.size()-i,10); k++){
      |                                    ~~~^~~~~~~~~~~~~~~
In file included from /usr/include/c++/14/algorithm:60,
                 from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:51,
                 from a.cc:1:
/usr/include/c++/14/bits/stl_algobase.h:233:5: note: candidate: 'template<class _Tp> constexpr const _Tp& std::min(const _Tp&, const _Tp&)'
  233 |     min(const _Tp& __a, const _Tp& __b)
      |     ^~~
/usr/include/c++/14/bits/stl_algobase.h:233:5: note:   template argument deduction/substitution failed:
a.cc:23:39: note:   deduced conflicting types for parameter 'const _Tp' ('long unsigned int' and 'int')
   23 |                 for(int k = 0; k < min(s.size()-i,10); k++){
      |                                    ~~~^~~~~~~~~~~~~~~
/usr/include/c++/14/bits/stl_algobase.h:281:5: note: candidate: 'template<class _Tp, class _Compare> constexpr const _Tp& std::min(const _Tp&, const _Tp&, _Compare)'
  281 |     min(const _Tp& __a, const _Tp& __b, _Compare __comp)
      |     ^~~
/usr/include/c++/14/bits/stl_algobase.h:281:5: note:   candidate expects 3 arguments, 2 provided
In file included from /usr/include/c++/14/algorithm:61:
/usr/include/c++/14/bits/stl_algo.h:5686:5: note: candidate: 'template<class _Tp> constexpr _Tp std::min(initializer_list<_Tp>)'
 5686 |     min(initializer_list<_Tp> __l)
      |     ^~~
/usr/include/c++/14/bits/stl_algo.h:5686:5: note:   candidate expects 1 argument, 2 provided
/usr/include/c++/14/bits/stl_algo.h:5696:5: note: candidate: 'template<class _Tp, class _Compare> constexpr _Tp std::min(initializer_list<_Tp>, _Compare)'
 5696 |     min(initializer_list<_Tp> __l, _Compare __comp)
      |     ^~~
/usr/include/c++/14/bits/stl_algo.h:5696:5: note:   template argument deduction/substitution failed:
a.cc:23:39: note:   mismatched types 'std::initializer_list<_Tp>' and 'long unsigned int'
   23 |                 for(int k = 0; k < min(s.size()-i,10); k++){
      |                                    ~~~^~~~~~~~~~~~~~~