Language: C++

#include <bits/stdc++.h>

using namespace std;

#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define fin(ans) cout << (ans) << endl;
#define mp(p, q) make_pair(p, q)
#define pb(n) push_back(n)
#define cb() pop_back()
#define all(a) a.begin(), a.end()

typedef long long ll;
typedef string str;
typedef vector<ll> vll;
typedef vector<pair<ll, str>> vpls;

void Main()
{
  ll x, y, a, b, c;
  ll sum = 0;
  cin >> x >> y >> a >> b >> c;
  vll p(a), q(b), r(c), s;
  rep(i, a) cin >> p[i];
  rep(i, b) cin >> q[i];
  rep(i, c) cin >> r[i];
  sort(all(p), greater<ll> ());
  while(1)
  {
    if (p.size() == x)
      break;
    p.cb();
  }
  sum += p[0];
  x--;
  sort(all(q), greater<ll> ());
  while(1)
  {
    if (q.size() == y)
      break;
    q.cb();
  }
  sum += q[0];
  y--;
  sort(all(r), greater<ll> ());
  while(1)
  {
    if (r.size() == x + y)
      break;
    r.cb();
  }
  vpls ans;
  rep(i, p.size()) ans.pb(mp(p[i], "r"));
  rep(i, q.size()) ans.pb(mp(q[i], "g"));
  rep(i, r.size()) ans.pb(mp(r[i], "m"));
  sort(all(ans), greater<ll> ());
  ll flag = 0;
  for(ll i = 0;;i++)
  {
    if(x > 0&&ans[i].second == "r")
    {
      sum += ans[i].first;
      x--;
    }
    else if(y > 0&&ans[i].second == "g")
    {
      sum += ans[i].first;
      y--;
    }
    else if(ans[i].second == "m")
    {
      sum += ans[i].first;
      flag++;
    }
    if(x + y - flag == 0)
    break;
  }
  fin(sum)
  return;
}

int main()
{
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout << fixed << setprecision(20); //高精度少数表示
  Main();
  return 0;
}


Compiler output:
In file included from /usr/include/c++/14/bits/stl_algobase.h:71,
                 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/predefined_ops.h: In instantiation of 'constexpr bool __gnu_cxx::__ops::_Iter_comp_iter<_Compare>::operator()(_Iterator1, _Iterator2) [with _Iterator1 = __gnu_cxx::__normal_iterator<std::pair<long long int, std::__cxx11::basic_string<char> >*, std::vector<std::pair<long long int, std::__cxx11::basic_string<char> > > >; _Iterator2 = __gnu_cxx::__normal_iterator<std::pair<long long int, std::__cxx11::basic_string<char> >*, std::vector<std::pair<long long int, std::__cxx11::basic_string<char> > > >; _Compare = std::greater<long long int>]':
/usr/include/c++/14/bits/stl_algo.h:1777:14:   required from 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<long long int, __cxx11::basic_string<char> >*, vector<pair<long long int, __cxx11::basic_string<char> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<greater<long long int> >]'
 1777 |           if (__comp(__i, __first))
      |               ~~~~~~^~~~~~~~~~~~~~
/usr/include/c++/14/bits/stl_algo.h:1817:25:   required from 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<long long int, __cxx11::basic_string<char> >*, vector<pair<long long int, __cxx11::basic_string<char> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<greater<long long int> >]'
 1817 |           std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/14/bits/stl_algo.h:1908:31:   required from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<long long int, __cxx11::basic_string<char> >*, vector<pair<long long int, __cxx11::basic_string<char> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<greater<long long int> >]'
 1908 |           std::__final_insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/14/bits/stl_algo.h:4805:18:   required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<long long int, __cxx11::basic_string<char> >*, vector<pair<long long int, __cxx11::basic_string<char> > > >; _Compare = greater<long long int>]'
 4805 |       std::__sort(__first, __last, __gnu_cxx::__ops::__iter_comp_iter(__comp));
      |       ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
a.cc:55:7:   required from here
   55 |   sort(all(ans), greater<ll> ());
      |   ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/14/bits/predefined_ops.h:158:30: error: no match for call to '(std::greater<long long int>) (std::pair<long long int, std::__cxx11::basic_string<char> >&, std::pair<long long int, std::__cxx11::basic_string<char> >&)'
  158 |         { return bool(_M_comp(*__it1, *__it2)); }
      |                       ~~~~~~~^~~~~~~~~~~~~~~~
In file included from /usr/include/c++/14/string:49,
                 from /usr/include/c++/14/bitset:52,
                 from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:52:
/usr/include/c++/14/bits/stl_function.h:394:7: note: candidate: 'constexpr bool std::greater<_Tp>::operator()(const _Tp&, const _Tp&) const [with _Tp = long long int]'
  394 |       operator()(const _Tp& __x, const _Tp& __y) const
      |       ^~~~~~~~
/usr/include/c++/14/bits/stl_function.h:394:29: note:   no known conversion for argument 1 from 'std::pair<long long int, std::__cxx11::basic_string<char> >' to 'const long long int&'
  394 |       operator()(const _Tp& __x, const _Tp& __y) const
      |                  ~~~~~~~~~~~^~~
/usr/include/c++/14/bits/predefined_ops.h: In instantiation of 'bool __gnu_cxx::__ops::_Val_comp_iter<_Compare>::operator()(_Value&, _Iterator) [with _Value = std::pair<long long int, std::__cxx11::basic_string<char> >; _Iterator = __gnu_cxx::__normal_iterator<std::pair<long long int, std::__cxx11::basic_string<char> >*, std::vector<std::pair<long long int, std::__cxx11::basic_string<char> > > >; _Compare = std::greater<long long int>]':
/usr/include/c++/14/bits/stl_algo.h:1757:20:   required from 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<long long int, __cxx11::basic_string<char> >*, vector<pair<long long int, __cxx11::basic_string<char> > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<greater<long long int> >]'
 1757 |       while (__comp(__val, __next))
      |              ~~~~~~^~~~~~~~~~~~~~~
/usr/include/c++/14/bits/stl_algo.h:1785:36:   required from 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<long long int, __cxx11::basic_string<char> >*, vector<pair<long long int, __cxx11::basic_string<char> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<greater<long long int> >]'
 1785 |             std::__unguarded_linear_insert(__i,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
 1786 |                                 __gnu_cxx::__ops::__val_comp_iter(__comp));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/14/bits/stl_algo.h:1817:25:   required from 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<long long int, __cxx11::basic_string<char> >*, vector<pair<long long int, __cxx11::basic_string<char> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<greater<long long int> >]'
 1817 |           std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/14/bits/stl_algo.h:1908:31:   required from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<long long int, __cxx11::basic_string<char> >*, vector<pair<long long int, __cxx11::basic_string<char> > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<greater<long long int> >]'
 1908 |           std::__final_insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/14/bits/stl_algo.h:4805:18:   required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<long long int, __cxx11::basic_string<char> >*, vector<pair<long long int, __cxx11::basic_string<char> > > >; _Compare = greater<long long int>]'
 4805 |       std::__sort(__first, __last, __gnu_cxx::__ops::__iter_comp_iter(__comp));
      |       ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
a.cc:55:7:   required from here
   55 |   sort(all(ans), greater<ll> ());
      |   ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/14/bits/predefined_ops.h:240:30: error: no match for call to '(std::greater<long long int>) (std::pair<long long int, std::__cxx11::basic_string<char> >&, std::pair<long long int, std::__cxx11::basic_string<char> >&)'
  240 |         { return bool(_M_comp(__val, *__it)); }
      |                       ~~~~~~~^~~~~~~~~~~~~~
/usr/include/c++/14/bits/stl_function.h:394:7: note: candidate: 'constexpr bool std::greater<_Tp>::operator()(const _Tp&, const _Tp&) const [with _Tp = long long int]'
  394 |       operator()(const _Tp& __x, const _Tp& __y) const
      |       ^~~~~~~~
/usr/include/c++/14/bits/stl_function.h:394:29: note:   no known conversion for argument 1 from 'std::pair<long long int, std::__cxx11::basic_string<char> >' to 'const long long int&'
  394 |       operator()(const _Tp& __x, const _Tp& __y) const
      |                  ~~~~~~~~~~~^~~
/usr/include/c++/14/bits/predefined_ops.h: In instantiation of 'bool __gnu_cxx::__ops::_Iter_comp_val<_Compare>::operator()(_Iterator, _Value&) [with _Iterator = __gnu_cxx::__normal_iterator<std::pair<long long int, std::__cxx11::basic_string<char> >*, std::vector<std::pair<long long int, std::__cxx11::basic_string<char> > > >; _Value = std::pair<long long int, std::__cxx11::basic_string<char> >; _Compare = std::greater<long long int>]':
/usr/include/c++/14/bits/stl_heap.h:140:48:   required from 'void std::__push_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<long long int, __cxx11::basic_string<char> >*, vector<pair<long long int, __cxx11::basic_string<char> > > >; _Distance = long int; _Tp = pair<long long int, __cxx11::basic_string<char> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<greater<long long int> >]'
  140 |       while (__holeIndex > __topIndex && __comp(__first + __parent, __value))
      |                                          ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/14/bits/stl_heap.h:247:23:   required from 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<long long int, __cxx11::basic_string<char> >*, vector<pair<long long int, __cxx11::basic_string<char> > > >; _Distance = long int; _Tp = pair<long long int, __cxx11::basic_string<char> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<greater<long long int> >]'
  247 |       std::__push_heap(__first, __holeIndex, __topIndex,
      |       ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  248 |                        _GLIBCXX_MOVE(__value), __cmp);
      |                        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/14/bits/stl_heap.h:356:22:   required from 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<long long int, __cxx11::basic_string<char> >*, vector<pair<long lo