zoukankan      html  css  js  c++  java
  • 快速切题 sgu133.Border 离线

    133. Border

    time limit per test: 0.25 sec. 
    memory limit per test: 4096 KB

     

    Along the border between states A and B there are N defence outposts. For every outpost k, the interval [Ak,Bk] which is guarded by it is known. Because of financial reasons, the president of country A decided that some of the outposts should be abandoned. In fact, all the redundant outposts will be abandoned. An outpost i is redundant if there exists some outpost j such that Aj<Ai and Bi<Bj. Your task is to find the number of redundant outposts.

     

    Input

    The first line of the input will contain the integer number N (1<=N<=16 000). N lines will follow, each of them containing 2 integers: Ak and Bk (0<= Ak < Bk <= 2 000 000 000), separated by blanks. All the numbers Awill be different. All the numbers Bk will be different.

     

    Output

    You should print the number of redundant outposts.

     

    Sample Input

    5
    0 10
    2 9
    3 8
    1 15
    6 11
    

    Sample Output

    3
    
    #include <cstring>
    #include <cstdio>
    #include <algorithm>
    using namespace std;
    typedef  long long ll;
    typedef pair<ll,ll> P;
    P seg[17000];
    int n;
    int main(){
        scanf("%d",&n);
        for(int i=0;i<n;i++){
            scanf("%I64d%I64d",&seg[i].first,&seg[i].second);
        }
        sort(seg,seg+n);
        ll maxn=seg[0].second;
        int cnt=0;
        for(int i=0;i<n;i++){
            if(seg[i].second<maxn)cnt++;
            else maxn=seg[i].second;
        }
        printf("%d\n",cnt);
    }
    

      

  • 相关阅读:
    Dom页面加载
    Redis
    Ubuntu下git的安装与使用
    类Xadmin插件--海豚插件
    Python基础指随笔
    前端必须掌握30个CSS3选择器
    SweetAlert插件示例
    Pylint在项目中的使用
    django Cookie、Session和自定义分页
    django创建超级用户
  • 原文地址:https://www.cnblogs.com/xuesu/p/4023487.html
Copyright © 2011-2022 走看看