HDU3193

Summer again! Flynn is ready for another tour around. Since the tour would take three or more days, it is important to find a hotel that meets for a reasonable price and gets as near as possible!
But there are so many of them! Flynn gets tired to look for any. It’s your time now! Given the

#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdio>
using namespace std;
int inf = 0x3f3f3f3f;
struct p
{
    int pp, d;
    bool operator < (const p&a)const {
        if (pp == a.pp)return d < a.d;
        return pp < a.pp;
    }
};
p tu[11001];
int ff[11001];
int main()
{
    int n;
    while (cin >> n)
    {
        memset(tu, 0, sizeof(tu));
        memset(ff, 0, sizeof(ff));
        for (int a = 1; a <= n; a++)scanf("%d%d", &tu[a].pp, &tu[a].d);
        sort(tu + 1, tu + n + 1);
        int jc = 0;
        int zuix = inf, tep = inf;
        for (int a = 1; a <= n; a++)
        {
            if (tu[a].pp != tu[a - 1].pp&&a!=1)
            {
                zuix = min(tep, zuix);
                tep = inf;
            }
            tep = min(tep, tu[a].d);
            if (zuix >= tu[a].d)ff[a] = 1, jc++;
        }
        cout << jc << endl;
        int jj = 0;
        for (int a = 1; a <= n; a++)
        {
            if (!ff[a])continue;
            printf("%d %d\n", tu[a].pp, tu[a].d);
        }
    }
    return 0;
}