hdoj2037_今年暑假不AC（贪心）

#include<iostream>#include<vector>#include<algorithm>#include<utility>using namespace std;bool cmp(pair<int, int> p1, pair<int, int> p2){    return p1.second < p2.second;}vector<pair<int,int>> v;int main(){    int n;    while (cin >> n&&n)    {        v.clear();        for (int i = 0; i < n; i++)        {            int b, e;            cin >> b >> e;            v.push_back(make_pair(b, e));        }        sort(v.begin(), v.end(), cmp);        int ans = 0;        int curt = 0;        for (int i = 0; i < n; i++)        {            if (v[i].first >= curt)            {                curt = v[i].second;                ans++;            }        }        cout << ans << endl;    }    return 0;}