Language: C++

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1000000007;

int main() {
    ios::sync_with_stdio(false);
    int n, w, a0, a, b, z = 0;
    vector<ll> c[4] = {};
    cin >> n >> w >> a >> b; a0 = a;
    c[0].push_back(b);
    for (int i = 1; i < n; i++) cin >> a >> b, c[a - a0].push_back(b);
    for (int i = 0; i < 4; i++) sort(c[i].begin(), c[i].end()), reverse(c[i].begin(), c[i].end()), c[i].insert(c[i].begin(), 0);
    for (int i = 0; i < 4; i++) for (int j = 1; j < c[i].size(); j++) c[i][j] += c[i][j - 1];
    for (int i = 0; i < c[0].size(); i++) for (int j = 0; j < c[1].size(); j++) for (int k = 0; k < c[2].size(); k++) for (int l = 0; l < c[3].size(); l++) if (i * a0 + j * (a0 + 1) + k * (a0 + 2) + l * (a0 + 3) <= w) z = max(z, c[0][i] + c[1][j] + c[2][k] + c[3][l]);
    cout << z << '\n';
}


Compiler output:
a.cc: In function 'int main()':
a.cc:16:226: error: no matching function for call to 'max(int&, __gnu_cxx::__alloc_traits<std::allocator<long long int>, long long int>::value_type)'
   16 |     for (int i = 0; i < c[0].size(); i++) for (int j = 0; j < c[1].size(); j++) for (int k = 0; k < c[2].size(); k++) for (int l = 0; l < c[3].size(); l++) if (i * a0 + j * (a0 + 1) + k * (a0 + 2) + l * (a0 + 3) <= w) z = max(z, c[0][i] + c[1][j] + c[2][k] + c[3][l]);
      |                                                                                                                                                                                                                               ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
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:16:226: note:   deduced conflicting types for parameter 'const _Tp' ('int' and '__gnu_cxx::__alloc_traits<std::allocator<long long int>, long long int>::value_type' {aka 'long long int'})
   16 |     for (int i = 0; i < c[0].size(); i++) for (int j = 0; j < c[1].size(); j++) for (int k = 0; k < c[2].size(); k++) for (int l = 0; l < c[3].size(); l++) if (i * a0 + j * (a0 + 1) + k * (a0 + 2) + l * (a0 + 3) <= w) z = max(z, c[0][i] + c[1][j] + c[2][k] + c[3][l]);
      |                                                                                                                                                                                                                               ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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:16:226: note:   mismatched types 'std::initializer_list<_Tp>' and 'int'
   16 |     for (int i = 0; i < c[0].size(); i++) for (int j = 0; j < c[1].size(); j++) for (int k = 0; k < c[2].size(); k++) for (int l = 0; l < c[3].size(); l++) if (i * a0 + j * (a0 + 1) + k * (a0 + 2) + l * (a0 + 3) <= w) z = max(z, c[0][i] + c[1][j] + c[2][k] + c[3][l]);
      |                                                                                                                                                                                                                               ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~