BNUOJ 44582 MLX的疯狂睡眠

题意：有n个睡觉的区间，每个区间之间不能重复，求最多能睡几次。

链接：http://www.bnuoj.com/v3/problem_show.php?pid=44582

思路：明显的贪心问题，以结束时间对结构体排序，遍历时贪心选择即可

注意点：手一贱把ti和t打混了，查了好长时间没查出来，以后还要多家注意

以下为AC代码：

Username	RunID	PID	Result	Language	Time	Memory	Length	Submit Time
luminous11	437183	44582	Accepted	GNU C++	4 ms	1812 KB	1311 B	2014-12-26 21:43:32

#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <vector>
#include <deque>
#include <list>
#include <cctype>
#include <algorithm>
#include <climits>
#include <queue>
#include <stack>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <cstdlib>
#include <ctime>
#define ll long long
#define ull unsigned long long
#define all(x) (x).begin(), (x).end()
#define clr(a, v) memset( a , v , sizeof(a) )
#define pb push_back
#define mp make_pair
#define read(f) freopen(f, "r", stdin)
#define write(f) freopen(f, "w", stdout)
using namespace std;

struct node{
    int be;
    int en;
    //bool operator < ( const node& a )const{ return en < a.en;}
}k[1000005];

bool cmp ( const node&a, const node& b )
{
    return a.en < b.en;
}

int main()
{
    int t;
    scanf ( "%d", &t );
    while ( t -- )
    {
        int n;
        scanf ( "%d", &n );
        for ( int i = 0; i < n; i ++ )
        {
            scanf ( "%d%d", &k[i].be, &k[i].en );
        }
        sort ( k, k + n, cmp );
        int ti = 0;
        int cnt = 0;
        for ( int i = 0; i < n; i ++ )
        {
            if ( k[i].be > ti )
            {
                cnt ++;
                ti = k[i].en;
            }
        }
        printf ( "%d\n", cnt );
    }
    return 0;
}