ZOJ 3787 Access System

题目链接：ZOJ 3787 Access System

水题。

#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <iterator>

using namespace std;
const int MAX_N = 20000 + 100;
int T, n, m;
struct Stu
{
    int time;
    int i;
};
int cmp(Stu s1, Stu s2)
{
    return s1.time < s2.time;
}
Stu s[MAX_N];
vector <int> q;
int main()
{
    scanf("%d", &T);
    while(T--)
    {
        scanf("%d%d" , &n, &m);
        int cnt, res, a, b, c, tmp;
        cnt = 0;
        for(int i = 0; i < n; i++)
        {
            scanf("%d:%d:%d", &a, &b, &c);
            s[i].time = a * 60 * 60 + b * 60 + c;
            s[i].i = i + 1;
        }
        sort(s, s + n, cmp);
        tmp = s[0].time;
        cnt++;
        q.push_back(s[0].i);
        for(int i = 1; i < n; i++)
        {
            if(s[i].time - tmp >= m)
            {
                cnt++;
                tmp = s[i].time;
                q.push_back(s[i].i);
            }
        }
        printf("%d\n", cnt);
        sort(q.begin(), q.end());
        vector<int>::iterator iter;
        for(iter = q.begin(); iter != q.end() - 1; iter++)
            printf("%d ", *iter);
        printf("%d\n", *iter);
        q.clear();
    }
    return 0;
}