Language: C++


//include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <fstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <string>
#include <cstring>
#include <ctime>
#include <climits>
#include <limits>

using namespace std;

//conversion
//------------------------------------------
inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; }
template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); }

//math
//-------------------------------------------
template<class T> inline T sqr(T x) { return x * x; }

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;

//container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define EXISTch(s,c) ((((s).find_first_of(c)) != std::string::npos)? 1 : 0)//cがあれば1 if(1)
#define SORT(c) sort((c).begin(),(c).end())

#define REP(i,n) for(int i=0;i<(int)n;++i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)

//constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int INF = (int)1000000007;
const LL MOD = (LL)1000000007;//10^9+7
const LL INF2 = (LL)100000000000000000;//10^18

int main() {

	LL n, m; cin >> n >> m;
	vector<priority_queue<LL>> tb(100010);

	//値、日時
	priority_queue<pair<LL,LL>> tmp;



	for (int i = 0; i < n; i++) {
		LL a, b; cin >> a >> b;

		tb[a].push(b);
	}

	LL ans = 0;

	
	for (LL i = 1; i < m + 1; i++) {


		if (tb[i].empty() && tmp.empty())continue;
		if (tb[i].empty() && !tmp.empty()) {
			ans += tmp.top().first;
			//暫定キューから取り出す
			LL num = tmp.top().second;
			//もとのキューからも取り出す
			tb[num].pop();
			tmp.pop();

			if (!tb[num].empty()) {
				tmp.push({ tb[num].top(),num });
			}
			
			continue;
		}

		if (tmp.empty()) {
			ans += tb[i].top();
			tb[i].pop();

			if (!tb[i].empty()) {
				tmp.push({ tb[i].top(), i });
			}

			continue;
		}

		
		LL today = tb[i].top();

		LL now = tmp.top().first;

		if (now > today) {
			//暫定キューから取り出す
			LL num = tmp.top().second;
			//もとのキューからも取り出す
			tb[num].pop();

			ans += now;
			tmp.pop();

			if (!tb[num].empty()) {
				tmp.push({ tb[num].top(),num });
			}

			
			pair<int, int> p;
			p.first = tb[i].top();
			p.second = i;

			tmp.push(p);

		}
		else if (now <= today) {
			ans += today;

			tb[i].pop();

			if (!tb[i].empty()) {
				tmp.push({ tb[i].top(),i });

		}
		
	}

	cout << ans << endl;
	return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:160:2: error: expected '}' at end of input
  160 | }
      |  ^
a.cc:71:12: note: to match this '{'
   71 | int main() {
      |            ^