F - History

最新推荐文章于 2019-01-24 14:46:13 发布

啾咪啾咪哼

最新推荐文章于 2019-01-24 14:46:13 发布

阅读量959

点赞数

分类专栏：数据结构

本文链接：https://blog.csdn.net/fq0909/article/details/22754219

版权

数据结构专栏收录该内容

47 篇文章 1 订阅

订阅专栏

Polycarpus likes studying at school a lot and he is always diligent about his homework. Polycarpus has never had any problems with natural sciences as his great-great-grandfather was the great physicist Seinstein. On the other hand though, Polycarpus has never had an easy time with history.

Everybody knows that the World history encompasses exactly n events: the i-th event had continued from the year a_i to the year b_iinclusive (a_i < b_i). Polycarpus easily learned the dates when each of n events started and ended (Polycarpus inherited excellent memory from his great-great-granddad). But the teacher gave him a more complicated task: Polycaprus should know when all events began and ended and he should also find out for each event whether it includes another event. Polycarpus' teacher thinks that an event j includes an event i if a_j < a_i and b_i < b_j. Your task is simpler: find the number of events that are included in some other event.

Input

The first input line contains integer n (1 ≤ n ≤ 10⁵) which represents the number of events. Next n lines contain descriptions of the historical events, one event per line. The i + 1 line contains two integers a_i and b_i (1 ≤ a_i < b_i ≤ 10⁹) — the beginning and the end of the i-th event. No two events start or finish in the same year, that is, a_i ≠ a_j, a_i ≠ b_j, b_i ≠ a_j, b_i ≠ b_j for all i, j (where i ≠ j). Events are given in arbitrary order.

Output

Print the only integer — the answer to the problem.

Sample Input

Input

Output

Input

Output

Input

1
1 1000000000

Output

Hint

In the first example the fifth event is contained in the fourth. Similarly, the fourth event is contained in the third, the third — in the second and the second — in the first.

In the second example all events except the first one are contained in the first.

In the third example only one event, so the answer is 0.

新学的知识。。结构体排序，啥也不说了、就觉得太帅了！！=>、、

#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;
struct node
{
    int a,b;
}F[505050];
int cmp(node x ,node y)
{
    return x.a<y.a;
}
int main()
{
    int n;
    int t;
    int i;
    while(scanf("%d",&n)!=EOF)
    {
        t=0;
        int m;
        for(i=0;i<n;i++)
        {
            scanf("%d%d",&F[i].a,&F[i].b);
        }
        sort(F,F+n,cmp);
        m = F[0].b;
        for(i=1;i<n;i++)
        {

            if(F[i].b<m)
            {
                t++;
            }
            else
            {
                m = F[i].b;
            }
        }
        printf("%d\n",t);

    }
    return 0;
}