Language: C++

    #include <bits/stdc++.h>
    using namespace std;
     
    # define NMAX 1000000001
     
    // void change(int b, int c, std::vector<int> &seq){
    //     for(int i=0; i < b; i++){
    //         if(seq.at(i) < c){
    //             seq.at(i) = c;
    //         }else{
    //             return;
    //         }
    //     }
    // }
    //
    // void map_change(){
    //
    // }
     
    int main(){
        int N, M;
        cin >> N >> M;
        std::vector<int> seq(N);
        for(int i=0; i < N; i++){
            cin >> seq.at(i);
        }
        vector<std::vector<int> > ope(M, vector<int>(2));
        std::map<int, int> ope_map;
        // for(int i=0; i < M; i++){
        //     cin >> ope.at(i).at(0) >> ope.at(i).at(1);
        // }
        int a, b;
        for(int i=0; i < M; i++){
            cin >> a >> b;
            if(ope_map.count(b)){
                ope_map[b] += a;
            }else{
                ope_map[b] = a;
            }
     
        }
        sort(seq.begin(), seq.end());
        std::vector<int> ope_seq(N, 0);
        int pointer = 0;
        for (map<int, int>::iterator iter = ope_map.rbegin(); iter != ope_map.rend(); ++iter){
            
          	int len = pointer + iter->second;
            for(int i=pointer; i < len; i++){
                ope_seq.at(i) = iter->first;
                pointer ++;
                if(pointer >= N){
                    break;
                }
            }
            if(pointer >= N){
                break;
            }
        }
        sort(ope_seq.begin(), ope_seq.end());
        // for(int i=0; i < N; i++){
        //     cout << seq.at(i) << " ";
        // }
        // cout << endl;
        // for(int i=0; i < N; i++){
        //     cout << ope_seq.at(i) << " ";
        // }
        // cout << endl;
        std::vector<int>::iterator iter_ope = ope_seq.end() - 1;
        std::vector<int>::iterator iter_seq = seq.end() - 1;
        long sum = 0;
        for(int i=0; i < N; i++){
            if(*iter_ope > *iter_seq){
                sum += *iter_ope;
                iter_ope --;
            }else{
                sum += *iter_seq;
                iter_seq --;
            }
        }
     
     
        // for(int i=0; i < M; i++){
        //     change(ope.at(i).at(0), ope.at(i).at(1), seq);
        // }
        // long sum = accumulate(seq.begin(), seq.end(), 0);
        cout << sum << endl;
    }

#include <bits/stdc++.h>
using namespace std;

# define NMAX 1000000001

// void change(int b, int c, std::vector<int> &seq){
//     for(int i=0; i < b; i++){
//         if(seq.at(i) < c){
//             seq.at(i) = c;
//         }else{
//             return;
//         }
//     }
// }
//
// void map_change(){
//
// }

int main(){
    int N, M;
    cin >> N >> M;
    std::vector<int> seq(N);
    for(int i=0; i < N; i++){
        cin >> seq.at(i);
    }
    vector<std::vector<int> > ope(M, vector<int>(2));
    std::map<int, int> ope_map;
    // for(int i=0; i < M; i++){
    //     cin >> ope.at(i).at(0) >> ope.at(i).at(1);
    // }
    int a, b;
    for(int i=0; i < M; i++){
        cin >> a >> b;
        if(ope_map.count(b)){
            ope_map[b] += a;
        }else{
            ope_map[b] = a;
        }

    }
    sort(seq.begin(), seq.end());
    std::vector<int> ope_seq(N, 0);
    int pointer = 0;
    for (map<int, int>::iterator iter = ope_map.rbegin(); iter != ope_map.rend(); ++iter){
        
      	int len = pointer + iter->second;
        for(int i=pointer; i < len; i++){
            ope_seq.at(i) = iter->first;
            pointer ++;
            if(pointer >= N){
                break;
            }
        }
        if(pointer >= N){
            break;
        }
    }
    sort(ope_seq.begin(), ope_seq.end());
    // for(int i=0; i < N; i++){
    //     cout << seq.at(i) << " ";
    // }
    // cout << endl;
    // for(int i=0; i < N; i++){
    //     cout << ope_seq.at(i) << " ";
    // }
    // cout << endl;
    std::vector<int>::iterator iter_ope = ope_seq.end() - 1;
    std::vector<int>::iterator iter_seq = seq.end() - 1;
    long sum = 0;
    for(int i=0; i < N; i++){
        if(*iter_ope > *iter_seq){
            sum += *iter_ope;
            iter_ope --;
        }else{
            sum += *iter_seq;
            iter_seq --;
        }
    }


    // for(int i=0; i < M; i++){
    //     change(ope.at(i).at(0), ope.at(i).at(1), seq);
    // }
    // long sum = accumulate(seq.begin(), seq.end(), 0);
    cout << sum << endl;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:45:59: error: conversion from 'std::map<int, int>::reverse_iterator' {aka 'std::reverse_iterator<std::_Rb_tree_iterator<std::pair<const int, int> > >'} to non-scalar type 'std::map<int, int>::iterator' {aka 'std::_Rb_tree<int, std::pair<const int, int>, std::_Select1st<std::pair<const int, int> >, std::less<int>, std::allocator<std::pair<const int, int> > >::iterator'} requested
   45 |         for (map<int, int>::iterator iter = ope_map.rbegin(); iter != ope_map.rend(); ++iter){
      |                                             ~~~~~~~~~~~~~~^~
a.cc:45:68: error: no match for 'operator!=' (operand types are 'std::map<int, int>::iterator' {aka 'std::_Rb_tree<int, std::pair<const int, int>, std::_Select1st<std::pair<const int, int> >, std::less<int>, std::allocator<std::pair<const int, int> > >::iterator'} and 'std::map<int, int>::reverse_iterator' {aka 'std::reverse_iterator<std::_Rb_tree_iterator<std::pair<const int, int> > >'})
   45 |         for (map<int, int>::iterator iter = ope_map.rbegin(); iter != ope_map.rend(); ++iter){
      |                                                               ~~~~ ^~ ~~~~~~~~~~~~~~
      |                                                               |                   |
      |                                                               |                   std::map<int, int>::reverse_iterator {aka std::reverse_iterator<std::_Rb_tree_iterator<std::pair<const int, int> > >}
      |                                                               std::map<int, int>::iterator {aka std::_Rb_tree<int, std::pair<const int, int>, std::_Select1st<std::pair<const int, int> >, std::less<int>, std::allocator<std::pair<const int, int> > >::iterator}
In file included from /usr/include/c++/14/regex:68,
                 from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:181,
                 from a.cc:1:
/usr/include/c++/14/bits/regex.h:1132:5: note: candidate: 'template<class _BiIter> bool std::__cxx11::operator!=(const sub_match<_BiIter>&, const sub_match<_BiIter>&)'
 1132 |     operator!=(const sub_match<_BiIter>& __lhs, const sub_match<_BiIter>& __rhs)
      |     ^~~~~~~~
/usr/include/c++/14/bits/regex.h:1132:5: note:   template argument deduction/substitution failed:
a.cc:45:84: note:   'std::map<int, int>::iterator' {aka 'std::_Rb_tree<int, std::pair<const int, int>, std::_Select1st<std::pair<const int, int> >, std::less<int>, std::allocator<std::pair<const int, int> > >::iterator'} is not derived from 'const std::__cxx11::sub_match<_BiIter>'
   45 |         for (map<int, int>::iterator iter = ope_map.rbegin(); iter != ope_map.rend(); ++iter){
      |                                                                                    ^
/usr/include/c++/14/bits/regex.h:1212:5: note: candidate: 'template<class _Bi_iter, class _Ch_traits, class _Ch_alloc> bool std::__cxx11::operator!=(__sub_match_string<_Bi_iter, _Ch_traits, _Ch_alloc>&, const sub_match<_BiIter>&)'
 1212 |     operator!=(const __sub_match_string<_Bi_iter, _Ch_traits, _Ch_alloc>& __lhs,
      |     ^~~~~~~~
/usr/include/c++/14/bits/regex.h:1212:5: note:   template argument deduction/substitution failed:
a.cc:45:84: note:   'std::map<int, int>::iterator' {aka 'std::_Rb_tree<int, std::pair<const int, int>, std::_Select1st<std::pair<const int, int> >, std::less<int>, std::allocator<std::pair<const int, int> > >::iterator'} is not derived from 'std::__cxx11::__sub_match_string<_Bi_iter, _Ch_traits, _Ch_alloc>'
   45 |         for (map<int, int>::iterator iter = ope_map.rbegin(); iter != ope_map.rend(); ++iter){
      |                                                                                    ^
/usr/include/c++/14/bits/regex.h:1305:5: note: candidate: 'template<class _Bi_iter, class _Ch_traits, class _Ch_alloc> bool std::__cxx11::operator!=(const sub_match<_BiIter>&, __sub_match_string<_Bi_iter, _Ch_traits, _Ch_alloc>&)'
 1305 |     operator!=(const sub_match<_Bi_iter>& __lhs,
      |     ^~~~~~~~
/usr/include/c++/14/bits/regex.h:1305:5: note:   template argument deduction/substitution failed:
a.cc:45:84: note:   'std::map<int, int>::iterator' {aka 'std::_Rb_tree<int, std::pair<const int, int>, std::_Select1st<std::pair<const int, int> >, std::less<int>, std::allocator<std::pair<const int, int> > >::iterator'} is not derived from 'const std::__cxx11::sub_match<_BiIter>'
   45 |         for (map<int, int>::iterator iter = ope_map.rbegin(); iter != ope_map.rend(); ++iter){
      |                                                                                    ^
/usr/include/c++/14/bits/regex.h:1379:5: note: candidate: 'template<class _Bi_iter> bool std::__cxx11::operator!=(const typename std::iterator_traits<_Iter>::value_type*, const sub_match<_BiIter>&)'
 1379 |     operator!=(typename iterator_traits<_Bi_iter>::value_type const* __lhs,
      |     ^~~~~~~~
/usr/include/c++/14/bits/regex.h:1379:5: note:   template argument deduction/substitution failed:
a.cc:45:84: note:   'std::map<int, int>::reverse_iterator' {aka 'std::reverse_iterator<std::_Rb_tree_iterator<std::pair<const int, int> > >'} is not derived from 'const std::__cxx11::sub_match<_BiIter>'
   45 |         for (map<int, int>::iterator iter = ope_map.rbegin(); iter != ope_map.rend(); ++iter){
      |                                                                                    ^
/usr/include/c++/14/bits/regex.h:1473:5: note: candidate: 'template<class _Bi_iter> bool std::__cxx11::operator!=(const sub_match<_BiIter>&, const typename std::iterator_traits<_Iter>::value_type*)'
 1473 |     operator!=(const sub_match<_Bi_iter>& __lhs,
      |     ^~~~~~~~
/usr/include/c++/14/bits/regex.h:1473:5: note:   template argument deduction/substitution failed:
a.cc:45:84: note:   'std::map<int, int>::iterator' {aka 'std::_Rb_tree<int, std::pair<const int, int>, std::_Select1st<std::pair<const int, int> >, std::less<int>, std::allocator<std::pair<const int, int> > >::iterator'} is not derived from 'const std::__cxx11::sub_match<_BiIter>'
   45 |         for (map<int, int>::iterator iter = ope_map.rbegin(); iter != ope_map.rend(); ++iter){
      |                                                                                    ^
/usr/include/c++/14/bits/regex.h:1547:5: note: candidate: 'template<class _Bi_iter> bool std::__cxx11::operator!=(const typename std::iterator_traits<_Iter>::value_type&, const sub_match<_BiIter>&)'
 1547 |     operator!=(typename iterator_traits<_Bi_iter>::value_type const& __lhs,
      |     ^~~~~~~~
/usr/include/c++/14/bits/regex.h:1547:5: note:   template argument deduction/substitution failed:
a.cc:45:84: note:   'std::map<int, int>::reverse_iterator' {aka 'std::reverse_iterator<std::_Rb_tree_iterator<std::pair<const int, int> > >'} is not derived from 'const std::__cxx11::sub_match<_BiIter>'
   45 |         for (map<int, int>::iterator iter = ope_map.rbegin(); iter != ope_map.rend(); ++iter){
      |                                                                                    ^
/usr/include/c++/14/bits/regex.h:1647:5: note: candidate: 'template<class _Bi_iter> bool std::__cxx11::operator!=(const sub_match<_BiIter>&, const typename std::iterator_traits<_Iter>::value_type&)'
 1647 |     operator!=(const sub_match<_Bi_iter>& __lhs,
      |     ^~~~~~~~
/usr/include/c++/14/bits/regex.h:1647:5: note:   template argument deduction/substitution failed:
a.cc:45:84: note:   'std::map<int, int>::iterator' {aka 'std::_Rb_tree<int, std::pair<const int, int>, std::_Select1st<std::pair<const int, int> >, std::less<int>, std::allocator<std::pair<const int, int> > >::iterator'} is not derived from 'const std::__cxx11::sub_match<_BiIter>'
   45 |         for (map<int, int>::iterator iter = ope_map.rbegin(); iter != ope_map.rend(); ++iter){
      |                                                                                    ^
/usr/include/c++/14/bits/regex.h:2213:5: note: candidate: 'template<class _Bi_iter, class _Alloc> bool std::__cxx11::operator!=(const match_results<_BiIter, _Alloc>&, const match_results<_BiIter, _Alloc>&)'
 2213 |     operator!=(const match_results<_Bi_iter, _Alloc>& __m1,
      |     ^~~~~~~~
/usr/include/c++/14/bits/regex.h:2213:5: note:   template argument deduction/substitution failed:
a.cc:45:84: note:   'std::map<int, int>::iterator' {aka 'std::_Rb_tree<int, std::pair<const int, int>, std::_Select1st<std::pair<const int, int> >, std::less<int>, std::allocator<std::pair<const int, int> > >::iterator'} is not derived from 'const std::__cxx11::match_results<_BiIter, _Alloc>'
   45 |         for (map<int, int>::iterator iter = ope_map.rbegin(); iter != ope_map.rend(); ++iter){
      |                                                                                    ^
In file included from /usr/include/c++/14/bits/stl_algobase.h:64,
                 from /usr/include/c++/14/algorithm:60,
                 from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:51:
/usr/include/c++/14/bits/stl_pair.h:1052:5: note: candidate: 'template<class _T1, class _T2> constexpr bool std::operator!=(const pair<_T1, _T2>&, const pair<_T1, _T2>&)'
 1052 |     operator!=(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)
      |     ^~~~~~~~
/usr/include/c++/14/bits/stl_pair.h:1052:5: note:   template argument deduction/substitution failed:
a.cc:45:84: note:   'std::map<int, int>::iterator' {aka 'std::_Rb_tree<int, std::pair<const int, int>, std::_Select1st<std::pair<const int, int> >, std::less<int>, std::allocator<std::pair<const int, int> > >::iterator'} is not derived from 'const std::pair<_T1, _T2>'
   45 |         for (map<int, int>::iterator iter = ope_map.rbegin(); iter != ope_map.rend(); ++iter){
      |                                                                                    ^
In file included from /usr/include/c++/14/bits/stl_algobase.h:67:
/usr/include/c++/14/bits/stl_iterator.h:455:5: note: candidate: 'template<class _Iterator> constexpr bool std::operator!=(const reverse_iterator<_Iterator>&, const reverse_iterator<_Iterator>&)'
  455 |     operator!=(const reverse_iterator<_Iterator>& __x,
      |     ^~~~~~~~
/usr/include/c++/14/bits/stl_iterator.h:455:5: note:   template argument deductio