2018/2

#include <iostream>
using namespace std;

struct el {
    unsigned x;
    unsigned y;
    el* left = nullptr;
    el* right = nullptr;
    el* prev = nullptr;
};

int main() {
    unsigned n, x, y;
    el* tree = nullptr;
    cin >> n;
    for (int i = 0; i < n; i++) {
        cin >> x >> y;
        if (tree != nullptr) {
            el* iter = tree;
            while (iter->next != nullptr && iter->y >= y)
                iter = iter->next;
        }
        else {
            el tmp = {x, y};
            tree = &tmp;
        }
    }
    return 0;
}