hdu 6180 Schedule（贪心）

题目链接：传送门

Schedule

Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 153428/153428 K (Java/Others)
Total Submission(s): 1111 Accepted Submission(s): 449

Problem Description
There are N schedules, the i-th schedule has start time si and end time ei (1 <= i <= N). There are some machines. Each two overlapping schedules cannot be performed in the same machine. For each machine the working time is defined as the difference between timeend and timestart , where time_{end} is time to turn off the machine and timestart is time to turn on the machine. We assume that the machine cannot be turned off between the timestart and the timeend.
Print the minimum number K of the machines for performing all schedules, and when only uses K machines, print the minimum sum of all working times.

Input
The first line contains an integer T (1 <= T <= 100), the number of test cases. Each case begins with a line containing one integer N (0 < N <= 100000). Each of the next N lines contains two integers si and ei (0<=si

#include<iostream>
#include<cstdio>
#include<cstring>
#include<stack>
#include<algorithm>
using namespace std;
typedef long long ll;
const int maxn = 1e5+10;
struct node
{
    ll x;
    int flag;
    bool operator < (const node &a) const
    {
        if(x == a.x) return flag > a.flag;
        else return x < a.x;
    }
} q[2*maxn];

int main()
{
    int t, n;
    cin >> t;
    while(t--)
    {
        scanf("%d", &n);
        ll ans = 0;
        int num = 1;
        for(int i=1; i<=n; i++)
        {
            scanf("%lld %lld",&q[num].x, &q[num+1].x);
            q[num].flag = 1, q[num+1].flag = 2;
            ans += q[num+1].x-q[num].x;
            num += 2;
        }
        sort(q+1, q+num);
        ll cnt = 0;
        stack<ll>s;
        while(!s.empty()) s.pop();
        for(int i = 1; i < num; i++)
        {
            if(q[i].flag == 1)//课的开始时间
            {
                if(!s.empty())//前面有可以连接的课
                {
                    ll tmp = s.top();
                    s.pop();
                    ans += q[i].x - tmp;
                }
                else //没有连接的课，就需要从新开一间教室
                    cnt++;
            }
            else//课结束，存入站中
                s.push(q[i].x);
        }
        printf("%lld %lld\n", cnt, ans);
    }
    return 0;
}