Selfish Grazing（贪心）

链接：https://ac.nowcoder.com/acm/problem/24867
来源：牛客网

题目描述
Each of Farmer John’s N (1 <= N <= 50,000) cows likes to graze in a certain part of the pasture, which can be thought of as a large one-dimeensional number line. Cow i’s favorite grazing range starts at location Si and ends at location Ei (1 <= Si < Ei; Si < Ei <= 100,000,000).
Most folks know the cows are quite selfish; no cow wants to share any of its grazing area with another. Thus, two cows i and j can only graze at the same time if either Si >= Ej or Ei <= Sj. FJ would like to know the maximum number of cows that can graze at the same time for a given set of cows and their preferences.

These ranges represent (2, 4), (1, 12), (4, 5), (7, 10), and (7, 8), respectively.
For a solution, the first, third, and fourth (or fifth) cows can all graze at the same time. If the second cow grazed, no other cows could graze. Also, the fourth and fifth cows cannot graze together, so it is impossible for four or more cows to graze.

输入描述:

• Line 1: A single integer: N
• Lines 2…N+1: Line i+1 contains the two space-separated integers: Si and Ei
  输出描述:
• Line 1: A single integer representing the maximum number of cows that can graze at once.
  示例1
  输入

5
2 4
1 12
4 5
7 10
7 8
输出

3

题意：略。

题记：跟hdu2037今年暑假不AC是一样的贪心题目，按照右端点排序即可。

#include<bits/stdc++.h>

using namespace std;
const int N=5e4+10;
struct Node{
    int l,r;
}node[N];

bool cmp(Node a,Node b){
    if(a.r==b.r)
        return a.l<b.l;
    return a.r<b.r;
}

int main(){
    int n;
    cin>>n;
    for(int i=0;i<n;i++){
        cin>>node[i].l>>node[i].r;
    }
    sort(node,node+n,cmp);
    int x=-1,ans=0;
    for(int i=0;i<n;i++){
        if(node[i].l>=x){
            ans++;
            x=node[i].r;
        }
    }
    cout<<ans<<endl;
    return 0;
}