Language: C++

#include<bits/stdc++.h>
#include <math.h>
#include <map>
#include <unordered_map>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define lper(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define ci(x) cin >>x
#define co(x) cout<<x<<endl
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9;
const ll INF=4e18;
const ll dy[4]={1,0,-1,0};
const ll dx[4]={0,-1,0,1};
long long fac(ll a) {
 long long ans=1;
 while(a>1){
 ans*=a;
 ans%=1000000007;
     a--;
    }
    return ans;
     }
int main() {
string S;
  cin >>S;
  ll K;
  cin >>K;
  ll x=S.size();
  
  vector<string> vec;
  repl(i,1,x+1) {//size
    rep(j,x-i+1) {
      ll y=vec.size();
      
      bool ans=true;
      repl(m,max(y-j,0),y) {
        if(vec.at(m)==S.substr(j,i) ) {
          ans=false;
          break;
        }
      }
      if(ans){
        vec.push_back(S.substr(j,i));
      }
    
    
    
    
    
    }
  }
    sort(all(vec));
  
  
  
  
  cout<<vec.at(K-1)<<endl;
}
      
 


Compiler output:
a.cc: In function 'int main()':
a.cc:49:17: error: no matching function for call to 'max(ll, int)'
   49 |       repl(m,max(y-j,0),y) {
      |              ~~~^~~~~~~
a.cc:7:31: note: in definition of macro 'repl'
    7 | #define repl(i,l,r) for(ll i=(l);i<(r);i++)
      |                               ^
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:257:5: note: candidate: 'template<class _Tp> constexpr const _Tp& std::max(const _Tp&, const _Tp&)'
  257 |     max(const _Tp& __a, const _Tp& __b)
      |     ^~~
/usr/include/c++/14/bits/stl_algobase.h:257:5: note:   template argument deduction/substitution failed:
a.cc:49:17: note:   deduced conflicting types for parameter 'const _Tp' ('long long int' and 'int')
   49 |       repl(m,max(y-j,0),y) {
      |              ~~~^~~~~~~
a.cc:7:31: note: in definition of macro 'repl'
    7 | #define repl(i,l,r) for(ll i=(l);i<(r);i++)
      |                               ^
/usr/include/c++/14/bits/stl_algobase.h:303:5: note: candidate: 'template<class _Tp, class _Compare> constexpr const _Tp& std::max(const _Tp&, const _Tp&, _Compare)'
  303 |     max(const _Tp& __a, const _Tp& __b, _Compare __comp)
      |     ^~~
/usr/include/c++/14/bits/stl_algobase.h:303: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:5706:5: note: candidate: 'template<class _Tp> constexpr _Tp std::max(initializer_list<_Tp>)'
 5706 |     max(initializer_list<_Tp> __l)
      |     ^~~
/usr/include/c++/14/bits/stl_algo.h:5706:5: note:   candidate expects 1 argument, 2 provided
/usr/include/c++/14/bits/stl_algo.h:5716:5: note: candidate: 'template<class _Tp, class _Compare> constexpr _Tp std::max(initializer_list<_Tp>, _Compare)'
 5716 |     max(initializer_list<_Tp> __l, _Compare __comp)
      |     ^~~
/usr/include/c++/14/bits/stl_algo.h:5716:5: note:   template argument deduction/substitution failed:
a.cc:49:17: note:   mismatched types 'std::initializer_list<_Tp>' and 'long long int'
   49 |       repl(m,max(y-j,0),y) {
      |              ~~~^~~~~~~
a.cc:7:31: note: in definition of macro 'repl'
    7 | #define repl(i,l,r) for(ll i=(l);i<(r);i++)
      |                               ^