RpmLgz - Online C++0x Compiler & Debugging Tool

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

int n, q;
vector<pair<int, int>> dolls;

void solve() {
    scanf("%d %d", &n, &q);
    for (int i = 0; i < n; i++) {
        int r, h; scanf("%d %d", &r, &h);
        dolls.push_back({h, r});
    }

    sort(dolls.begin(), dolls.end(), [](pair<int, int> A, pair<int, int> B) {
        return A.second < B.second;
    });

    // .first = h
    // .second = r

    vector<pair<int, int>> current;
    while (q--) {
        current.clear();
        int a, b; scanf("%d %d", &a, &b);

        for (int i = 0; i < n; i++) {
            if (dolls[i].first <= b && dolls[i].second >= a)
                current.push_back({dolls[i].first, dolls[i].second});
        }

        vector<int> SongNghi;
        int m = current.size();
        for (int i = 0; i < m; i++) {
            auto k = upper_bound(SongNghi.begin(), SongNghi.end(), current[i].first);
            if (k != SongNghi.begin()) {
                --k;
                *k = current[i].first;
            } else SongNghi.push_back(current[i].first);
        }

        printf("%d\n", (int)SongNghi.size());
    }
}

int main() {
    solve();
}