Submission #531055

#	Time	Username	Problem	Language	Result	Execution time	Memory
531055		kaxzert	Cloud Computing (CEOI18_clo)	C++17	Compilation error	0 ms	0 KiB

This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.

/**
      ⚡⚡  ⚡⚡      ⚡⚡⚡     ⚡⚡  ⚡⚡  ⚡⚡⚡⚡⚡⚡  ⚡⚡⚡⚡⚡   ⚡⚡⚡⚡⚡⚡  ⚡⚡⚡⚡⚡⚡
      ⚡⚡ ⚡⚡      ⚡⚡⚡⚡      ⚡⚡ ⚡⚡     ⚡⚡   ⚡⚡      ⚡⚡  ⚡⚡  ⚡⚡⚡⚡⚡⚡
      ⚡⚡⚡⚡      ⚡⚡  ⚡⚡      ⚡⚡      ⚡⚡    ⚡⚡⚡⚡⚡   ⚡⚡⚡⚡⚡⚡    ⚡⚡
      ⚡⚡ ⚡⚡    ⚡⚡⚡⚡⚡⚡⚡⚡   ⚡⚡ ⚡⚡    ⚡⚡     ⚡⚡      ⚡⚡  ⚡⚡    ⚡⚡
      ⚡⚡  ⚡⚡  ⚡⚡     ⚡⚡  ⚡⚡  ⚡⚡  ⚡⚡⚡⚡⚡⚡   ⚡⚡⚡⚡⚡   ⚡⚡   ⚡⚡   ⚡⚡
**/

#include<bits/stdc++.h>

using namespace std;

#define fto(i, a, b) for(int i = a; i <= b; ++i)
#define fdto(i, a, b) for(int i = a; i >= b; --i)
#define bugarr(a, i, j) cout << #a << "{" << i << "..." << j << "}:"; fto(k, i, j-1) cout << a[k] << ", "; cout << a[j] << endl;
#define ll long long
#define db double
#define ldb long double
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define vt vector
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define trav(i, a) for(auto &i : a)
#define sz(a) (int)a.size()
#define pi(a, b) pair<a, b>
#define fast ios::sync_with_stdio(false); cin.tie(0)

void setIO(string s) {
    if (sz(s) != 0) {
        freopen((s+".inp").c_str(),"r",stdin);
        freopen((s+".out").c_str(),"w",stdout);
    }
}

void setIOusaco(string s) {
    if (sz(s) != 0) {
        freopen((s+".in").c_str(),"r",stdin);
        freopen((s+".out").c_str(),"w",stdout);
    }
}

template<typename T, typename V>
bool ckmin(T &a, V b) {return (b < a)? a = b, true : false;}
template<typename T, typename V>
bool ckmax(T &a, V b) {return (b > a)? a = b, true : false;}

const int maxN = 2001;
ll f[maxN+1][maxN][51];
int n, m;
array<int, 3> buy[maxN], sold[maxN];

ll dp(int i, int j, int k) {
    assert(k <= 50);
    if (j > m) return 0;
    if (f[i][j][k] != -1) return f[i][j][k];
    if (i > n) {
        ll res = dp(i, j+1, k);
        if (sold[j][0] <= k) res = max(res, dp(i, j+1, k-sold[j][0])+sold[j][2]);
        return f[i][j][k] = res;
    }

    ll res = max({dp(i+1, j, k), dp(i, j+1, k), 0LL});
    if (k >= sold[j][0]) {
        res = max(res, dp(i, j+1, k-sold[j][0]) + sold[j][2]);
    } else {
        if (buy[i][1] >= sold[j][1]) {
            if (buy[i][0]+k < sold[j][0]) {
                res = max(res, dp(i+1, j, buy[i][0]+k)-buy[i][2]);
            } else {
                res = max(res, dp(i+1, j+1, buy[i][0]+k-sold[j][0])-buy[i][2]+sold[j][2]);
            }
        }
    }

    return f[i][j][k] = res;
}

int main() {
    #ifndef TAP 
    setIO("");
    //setIOusaco("CEOI18_clo");
    #endif

    fast;
    cin >> n;
    fto(i, 1, n) {
        cin >> buy[i][0] >> buy[i][1] >> buy[i][2];
    }
    sort(buy+1, buy+1+n, [](array<ll, 3> a, array<ll, 3> b){
        return a[1] > b[1];
    });

    cin >> m;
    fto(i, 1, m) {
        cin >> sold[i][0] >> sold[i][1] >> sold[i][2];
    }

    sort(sold+1, sold+m+1, [](array<ll, 3> a, array<ll, 3> b) {
        return a[1] > b[1];
    });

    fto(i, 1, n+1) {
        fto(j, 1, m) {
            fto(k, 0, 50) f[i][j][k] = -1;
        }
    }

    cout << dp(1, 1, 0) << '\n';

    return 0;
}

Compilation message (stderr)

In file included from /usr/include/c++/10/bits/stl_algobase.h:71,
                 from /usr/include/c++/10/bits/specfun.h:45,
                 from /usr/include/c++/10/cmath:1927,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:41,
                 from clo.cpp:9:
/usr/include/c++/10/bits/predefined_ops.h: In instantiation of 'constexpr bool __gnu_cxx::__ops::_Iter_comp_iter<_Compare>::operator()(_Iterator1, _Iterator2) [with _Iterator1 = std::array<int, 3>*; _Iterator2 = std::array<int, 3>*; _Compare = main()::<lambda(std::array<long long int, 3>, std::array<long long int, 3>)>]':
/usr/include/c++/10/bits/stl_algo.h:82:17:   required from 'void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = std::array<int, 3>*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<main()::<lambda(std::array<long long int, 3>, std::array<long long int, 3>)> >]'
/usr/include/c++/10/bits/stl_algo.h:1924:34:   required from '_RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = std::array<int, 3>*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<main()::<lambda(std::array<long long int, 3>, std::array<long long int, 3>)> >]'
/usr/include/c++/10/bits/stl_algo.h:1958:38:   required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = std::array<int, 3>*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<main()::<lambda(std::array<long long int, 3>, std::array<long long int, 3>)> >]'
/usr/include/c++/10/bits/stl_algo.h:1974:25:   required from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = std::array<int, 3>*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<main()::<lambda(std::array<long long int, 3>, std::array<long long int, 3>)> >]'
/usr/include/c++/10/bits/stl_algo.h:4892:18:   required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = std::array<int, 3>*; _Compare = main()::<lambda(std::array<long long int, 3>, std::array<long long int, 3>)>]'
clo.cpp:95:6:   required from here
/usr/include/c++/10/bits/predefined_ops.h:156:30: error: no match for call to '(main()::<lambda(std::array<long long int, 3>, std::array<long long int, 3>)>) (std::array<int, 3>&, std::array<int, 3>&)'
  156 |         { return bool(_M_comp(*__it1, *__it2)); }
      |                       ~~~~~~~^~~~~~~~~~~~~~~~
/usr/include/c++/10/bits/predefined_ops.h:156:30: note: candidate: 'bool (*)(std::array<long long int, 3>, std::array<long long int, 3>)' (conversion)
/usr/include/c++/10/bits/predefined_ops.h:156:30: note:   candidate expects 3 arguments, 3 provided
clo.cpp:93:26: note: candidate: 'main()::<lambda(std::array<long long int, 3>, std::array<long long int, 3>)>'
   93 |     sort(buy+1, buy+1+n, [](array<ll, 3> a, array<ll, 3> b){
      |                          ^
clo.cpp:93:26: note:   no known conversion for argument 1 from 'array<int,[...]>' to 'array<long long int,[...]>'
In file included from /usr/include/c++/10/bits/stl_algobase.h:71,
                 from /usr/include/c++/10/bits/specfun.h:45,
                 from /usr/include/c++/10/cmath:1927,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:41,
                 from clo.cpp:9:
/usr/include/c++/10/bits/predefined_ops.h: In instantiation of 'constexpr bool __gnu_cxx::__ops::_Iter_comp_iter<_Compare>::operator()(_Iterator1, _Iterator2) [with _Iterator1 = std::array<int, 3>*; _Iterator2 = std::array<int, 3>*; _Compare = main()::<lambda(std::array<long long int, 3>, std::array<long long int, 3>)>]':
/usr/include/c++/10/bits/stl_algo.h:82:17:   required from 'void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = std::array<int, 3>*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<main()::<lambda(std::array<long long int, 3>, std::array<long long int, 3>)> >]'
/usr/include/c++/10/bits/stl_algo.h:1924:34:   required from '_RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = std::array<int, 3>*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<main()::<lambda(std::array<long long int, 3>, std::array<long long int, 3>)> >]'
/usr/include/c++/10/bits/stl_algo.h:1958:38:   required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = std::array<int, 3>*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<main()::<lambda(std::array<long long int, 3>, std::array<long long int, 3>)> >]'
/usr/include/c++/10/bits/stl_algo.h:1974:25:   required from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = std::array<int, 3>*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<main()::<lambda(std::array<long long int, 3>, std::array<long long int, 3>)> >]'
/usr/include/c++/10/bits/stl_algo.h:4892:18:   required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = std::array<int, 3>*; _Compare = main()::<lambda(std::array<long long int, 3>, std::array<long long int, 3>)>]'
clo.cpp:104:6:   required from here
/usr/include/c++/10/bits/predefined_ops.h:156:30: error: no match for call to '(main()::<lambda(std::array<long long int, 3>, std::array<long long int, 3>)>) (std::array<int, 3>&, std::array<int, 3>&)'
  156 |         { return bool(_M_comp(*__it1, *__it2)); }
      |                       ~~~~~~~^~~~~~~~~~~~~~~~
/usr/include/c++/10/bits/predefined_ops.h:156:30: note: candidate: 'bool (*)(std::array<long long int, 3>, std::array<long long int, 3>)' (conversion)
/usr/include/c++/10/bits/predefined_ops.h:156:30: note:   candidate expects 3 arguments, 3 provided
clo.cpp:102:28: note: candidate: 'main()::<lambda(std::array<long long int, 3>, std::array<long long int, 3>)>'
  102 |     sort(sold+1, sold+m+1, [](array<ll, 3> a, array<ll, 3> b) {
      |                            ^
clo.cpp:102:28: note:   no known conversion for argument 1 from 'array<int,[...]>' to 'array<long long int,[...]>'
In file included from /usr/include/c++/10/bits/stl_algobase.h:71,
                 from /usr/include/c++/10/bits/specfun.h:45,
                 from /usr/include/c++/10/cmath:1927,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:41,
                 from clo.cpp:9:
/usr/include/c++/10/bits/predefined_ops.h: In instantiation of 'bool __gnu_cxx::__ops::_Val_comp_iter<_Compare>::operator()(_Value&, _Iterator) [with _Value = std::array<int, 3>; _Iterator = std::array<int, 3>*; _Compare = main()::<lambda(std::array<long long int, 3>, std::array<long long int, 3>)>]':
/usr/include/c++/10/bits/stl_algo.h:1826:20:   required from 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = std::array<int, 3>*; _Compare = __gnu_cxx::__ops::_Val_comp_iter<main()::<lambda(std::array<long long int, 3>, std::array<long long int, 3>)> >]'
/usr/include/c++/10/bits/stl_algo.h:1854:36:   required from 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = std::array<int, 3>*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<main()::<lambda(std::array<long long int, 3>, std::array<long long int, 3>)> >]'
/usr/include/c++/10/bits/stl_algo.h:1886:25:   required from 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = std::array<int, 3>*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<main()::<lambda(std::array<long long int, 3>, std::array<long long int, 3>)> >]'
/usr/include/c++/10/bits/stl_algo.h:1977:31:   required from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = std::array<int, 3>*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<main()::<lambda(std::array<long long int, 3>, std::array<long long int, 3>)> >]'
/usr/include/c++/10/bits/stl_algo.h:4892:18:   required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = std::array<int, 3>*; _Compare = main()::<lambda(std::array<long long int, 3>, std::array<long long int, 3>)>]'
clo.cpp:95:6:   required from here
/usr/include/c++/10/bits/predefined_ops.h:238:23: error: no match for call to '(main()::<lambda(std::array<long long int, 3>, std::array<long long int, 3>)>) (std::array<int, 3>&, std::array<int, 3>&)'
  238 |  { return bool(_M_comp(__val, *__it)); }
      |                ~~~~~~~^~~~~~~~~~~~~~
/usr/include/c++/10/bits/predefined_ops.h:238:23: note: candidate: 'bool (*)(std::array<long long int, 3>, std::array<long long int, 3>)' (conversion)
/usr/include/c++/10/bits/predefined_ops.h:238:23: note:   candidate expects 3 arguments, 3 provided
clo.cpp:93:26: note: candidate: 'main()::<lambda(std::array<long long int, 3>, std::array<long long int, 3>)>'
   93 |     sort(buy+1, buy+1+n, [](array<ll, 3> a, array<ll, 3> b){
      |                          ^
clo.cpp:93:26: note:   no known conversion for argument 1 from 'array<int,[...]>' to 'array<long long int,[...]>'
In file included from /usr/include/c++/10/bits/stl_algobase.h:71,
                 from /usr/include/c++/10/bits/specfun.h:45,
                 from /usr/include/c++/10/cmath:1927,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:41,
                 from clo.cpp:9:
/usr/include/c++/10/bits/predefined_ops.h: In instantiation of 'bool __gnu_cxx::__ops::_Val_comp_iter<_Compare>::operator()(_Value&, _Iterator) [with _Value = std::array<int, 3>; _Iterator = std::array<int, 3>*; _Compare = main()::<lambda(std::array<long long int, 3>, std::array<long long int, 3>)>]':
/usr/include/c++/10/bits/stl_algo.h:1826:20:   required from 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = std::array<int, 3>*; _Compare = __gnu_cxx::__ops::_Val_comp_iter<main()::<lambda(std::array<long long int, 3>, std::array<long long int, 3>)> >]'
/usr/include/c++/10/bits/stl_algo.h:1854:36:   required from 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = std::array<int, 3>*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<main()::<lambda(std::array<long long int, 3>, std::array<long long int, 3>)> >]'
/usr/include/c++/10/bits/stl_algo.h:1886:25:   required from 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = std::array<int, 3>*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<main()::<lambda(std::array<long long int, 3>, std::array<long long int, 3>)> >]'
/usr/include/c++/10/bits/stl_algo.h:1977:31:   required from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = std::array<int, 3>*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<main()::<lambda(std::array<long long int, 3>, std::array<long long int, 3>)> >]'
/usr/include/c++/10/bits/stl_algo.h:4892:18:   required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = std::array<int, 3>*; _Compare = main()::<lambda(std::array<long long int, 3>, std::array<long long int, 3>)>]'
clo.cpp:104:6:   required from here
/usr/include/c++/10/bits/predefined_ops.h:238:23: error: no match for call to '(main()::<lambda(std::array<long long int, 3>, std::array<long long int, 3>)>) (std::array<int, 3>&, std::array<int, 3>&)'
  238 |  { return bool(_M_comp(__val, *__it)); }
      |                ~~~~~~~^~~~~~~~~~~~~~
/usr/include/c++/10/bits/predefined_ops.h:238:23: note: candidate: 'bool (*)(std::array<long long int, 3>, std::array<long long int, 3>)' (conversion)
/usr/include/c++/10/bits/predefined_ops.h:238:23: note:   candidate expects 3 arguments, 3 provided
clo.cpp:102:28: note: candidate: 'main()::<lambda(std::array<long long int, 3>, std::array<long long int, 3>)>'
  102 |     sort(sold+1, sold+m+1, [](array<ll, 3> a, array<ll, 3> b) {
      |                            ^
clo.cpp:102:28: note:   no known conversion for argument 1 from 'array<int,[...]>' to 'array<long long int,[...]>'
In file included from /usr/include/c++/10/bits/stl_algobase.h:71,
                 from /usr/include/c++/10/bits/specfun.h:45,
                 from /usr/include/c++/10/cmath:1927,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:41,
                 from clo.cpp:9:
/usr/include/c++/10/bits/predefined_ops.h: In instantiation of 'bool __gnu_cxx::__ops::_Iter_comp_val<_Compare>::operator()(_Iterator, _Value&) [with _Iterator = std::array<int, 3>*; _Value = std::array<int, 3>; _Compare = main()::<lambda(std::array<long long int, 3>, std::array<long long int, 3>)>]':
/usr/include/c++/10/bits/stl_heap.h:139:48:   required from 'void std::__push_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare&) [with _RandomAccessIterator = std::array<int, 3>*; _Distance = long int; _Tp = std::array<int, 3>; _Compare = __gnu_cxx::__ops::_Iter_comp_val<main()::<lambda(std::array<long long int, 3>, std::array<long long int, 3>)> >]'
/usr/include/c++/10/bits/stl_heap.h:246:23:   required from 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = std::array<int, 3>*; _Distance = long int; _Tp = std::array<int, 3>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<main()::<lambda(std::array<long long int, 3>, std::array<long long int, 3>)> >]'
/usr/include/c++/10/bits/stl_heap.h:355:22:   required from 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = std::array<int, 3>*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<main()::<lambda(std::array<long long int, 3>, std::array<long long int, 3>)> >]'
/usr/include/c++/10/bits/stl_algo.h:1666:23:   required from 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = std::array<int, 3>*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<main()::<lambda(std::array<long long int, 3>, std::array<long long int, 3>)> >]'
/usr/include/c++/10/bits/stl_algo.h:1937:25:   required from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = std::array<int, 3>*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<main()::<lambda(std::array<long long int, 3>, std::array<long long int, 3>)> >]'
/usr/include/c++/10/bits/stl_algo.h:1953:27:   required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = std::array<int, 3>*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<main()::<lambda(std::array<long long int, 3>, std::array<long long int, 3>)> >]'
/usr/include/c++/10/bits/stl_algo.h:1974:25:   required from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = std::array<int, 3>*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<main()::<lambda(std::array<long long int, 3>, std::array<long long int, 3>)> >]'
/usr/include/c++/10/bits/stl_algo.h:4892:18:   required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = std::array<int, 3>*; _Compare = main()::<lambda(std::array<long long int, 3>, std::array<long long int, 3>)>]'
clo.cpp:95:6:   required from here
/usr/include/c++/10/bits/predefined_ops.h:194:23: error: no match for call to '(main()::<lambda(std::array<long long int, 3>, std::array<long long int, 3>)>) (std::array<int, 3>&, std::array<int, 3>&)'
  194 |  { return bool(_M_comp(*__it, __val)); }
      |                ~~~~~~~^~~~~~~~~~~~~~
/usr/include/c++/10/bits/predefined_ops.h:194:23: note: candidate: 'bool (*)(std::array<long long int, 3>, std::array<long long int, 3>)' (conversion)
/usr/include/c++/10/bits/predefined_ops.h:194:23: note:   candidate expects 3 arguments, 3 provided
clo.cpp:93:26: note: candidate: 'main()::<lambda(std::array<long long int, 3>, std::array<long long int, 3>)>'
   93 |     sort(buy+1, buy+1+n, [](array<ll, 3> a, array<ll, 3> b){
      |                          ^
clo.cpp:93:26: note:   no known conversion for argument 1 from 'array<int,[...]>' to 'array<long long int,[...]>'
In file included from /usr/include/c++/10/bits/stl_algobase.h:71,
                 from /usr/include/c++/10/bits/specfun.h:45,
                 from /usr/include/c++/10/cmath:1927,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:41,
                 from clo.cpp:9:
/usr/include/c++/10/bits/predefined_ops.h: In instantiation of 'bool __gnu_cxx::__ops::_Iter_comp_val<_Compare>::operator()(_Iterator, _Value&) [with _Iterator = std::array<int, 3>*; _Value = std::array<int, 3>; _Compare = main()::<lambda(std::array<long long int, 3>, std::array<long long int, 3>)>]':
/usr/include/c++/10/bits/stl_heap.h:139:48:   required from 'void std::__push_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare&) [with _RandomAccessIterator = std::array<int, 3>*; _Distance = long int; _Tp = std::array<int, 3>; _Compare = __gnu_cxx::__ops::_Iter_comp_val<main()::<lambda(std::array<long long int, 3>, std::array<long long int, 3>)> >]'
/usr/include/c++/10/bits/stl_heap.h:246:23:   required from 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = std::array<int, 3>*; _Distance = long int; _Tp = std::array<int, 3>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<main()::<lambda(std::array<long long int, 3>, std::array<long long int, 3>)> >]'
/usr/include/c++/10/bits/stl_heap.h:355:22:   required from 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = std::array<int, 3>*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<main()::<lambda(std::array<long long int, 3>, std::array<long long int, 3>)> >]'
/usr/include/c++/10/bits/stl_algo.h:1666:23:   required from 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = std::array<int, 3>*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<main()::<lambda(std::array<long long int, 3>, std::array<long long int, 3>)> >]'
/usr/include/c++/10/bits/stl_algo.h:1937:25:   required from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = std::array<int, 3>*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<main()::<lambda(std::array<long long int, 3>, std::array<long long int, 3>)> >]'
/usr/include/c++/10/bits/stl_algo.h:1953:27:   required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = std::array<int, 3>*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<main()::<lambda(std::array<long long int, 3>, std::array<long long int, 3>)> >]'
/usr/include/c++/10/bits/stl_algo.h:1974:25:   required from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = std::array<int, 3>*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<main()::<lambda(std::array<long long