Language: C++

#include <bits/stdc++.h>

using namespace std;

#define int long long
#define FR first
#define SC second
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define reps(i, f, n) for(int i = (int)(f); i < (int)(n); i++)
#define each(a, b) for(auto& a : b)

typedef pair<int, string> P;

const int inf = 1LL << 55;
const int mod = 1e9 + 7;

int N, M, K, L;
set<string> favname;
vector<P> dic, fav, unf;

bool check(int k)
{
  if(unf.size() < K-k+1) return true;
  int l = 0;
  for(int i = 0; i < k; i++) {
    l += max(0, fav[i].first - unf[K-k].first);
    if(fav[i].second > unf[K-k].second) l++;    
  }
  return l <= L;
}

signed main()
{
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  cout << fixed << setprecision(12);

  while(cin >> N >> M >> K >> L, N) {
    dic.clear();
    for(int i = 0; i < N; i++) {
      string name; int x;          
      cin >> name >> x;
      dic.push_back(P(-x, name));
    }
    favname.clear();
    for(int i = 0; i < M; i++) {
      string name; cin >> name;
      favname.insert(name);
    }
    fav.clear();
    unf.clear();
    for(auto a : dic) {
      if(favname.find(a.second) != favname.end()) fav.push_back(a);
      else unf.push_back(a);
    }
    sort(all(fav));
    sort(all(unf));
    int lb = 0, ub = min(M, K) + 1;
    while(lb + 1 < ub) {
      int mb = (lb + ub) / 2;
      if(check(mb)) lb = mb;
      else ub = mb;
    }
    cout << lb << endl;
  }
  
  return 0;
}

Compiler output:
a.cc: In function 'bool check(long long int)':
a.cc:28:13: error: no matching function for call to 'max(int, long long int)'
   28 |     l += max(0, fav[i].first - unf[K-k].first);
      |          ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
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:28:13: note:   deduced conflicting types for parameter 'const _Tp' ('int' and 'long long int')
   28 |     l += max(0, fav[i].first - unf[K-k].first);
      |          ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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:28:13: note:   mismatched types 'std::initializer_list<_Tp>' and 'int'
   28 |     l += max(0, fav[i].first - unf[K-k].first);
      |          ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~