_sol.cpp

#include<bits/stdc++.h>
 
using namespace std;
 
#define DEBUG(x) cout << #x << " = " << x << endl;

#define fi first
#define se second
#define pb push_back
#define mp make_pair

#define all(x) (x).begin() , (x).end()
#define rall(x) (x).rbegin() , (x).rend()

typedef long long LL;

int main() {
	
#ifndef ONLINE_JUDGE 
	freopen("in.txt", "r", stdin); 
#endif
	
	// Write code here...
}

// N decimal places
// cout << fixed << setprecision(6);
// cout << (1.0 * 2 / 3) << endl;

// vector <int> dp(MAXN + 1, -1);

// vector<vector<LL>> nCr(N, vector<LL> (M, -1));

// struct ListNode {
//     int val;
//     ListNode *next;
//     ListNode() : val(0), next(nullptr) {}
//     ListNode(int x) : val(x), next(nullptr) {}
//     ListNode(int x, ListNode *next) : val(x), next(next) {}
// };

// SegmentTree* segmentTree = new SegmentTree(vec, N);
// segmentTree -> build(vec, 1, 0, N - 1);

// priority_queue<int> max_q; max_q.pop(); max_q.top(); max_q.empty();
// priority_queue<int, vector<int>, greater<int>> min_q;