Submission #3726168

---

Source Code Expand

#include <iostream>
#include <fstream>
#include <sstream>
#include <iomanip>
#include <vector>
#include <string>
#include <algorithm>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <bitset>
#include <limits>
#include <random>
#include <complex>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cassert>
using namespace std;

#define REP(i,n) for (int i = 0; i < n; i++)
template <class T> using reversed_priority_queue = priority_queue<T, vector<T>, greater<T> >;
typedef long long ll;

int main ()
{
    int N; cin >> N;
    vector < int > x(N),y(N);
    REP(i,N) cin >> x[i] >> y[i];

    vector < int > val(N * 2);
    REP(i,N) {
        val.push_back(x[i]);
        val.push_back(y[i]);
    }

    sort(val.begin(), val.end());
    int min_val = val.front();
    int max_val = val.back();

    int max1 = -1e9 - 1, min1 = 1e9 + 1;
    REP(i,N) {
        max1 = max(max1, max(x[i], y[i]));
        min1 = min(min1, min(x[i], y[i]));
    }

    int 

    return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:52:5: error: expected unqualified-id before ‘return’
     return 0;
     ^