Milking Cows 挤牛奶 USACO 排序 模拟

#include<bits/stdc++.h>
using namespace std;
struct Node{
    int Begin,End;//结构体大法好 
}milk[5005];
int cmp(Node a,Node b){
    return a.Begin<b.Begin;//其实那个End不用考虑啊 
}
int main(){
    int n;
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
        scanf("%d%d",&milk[i].Begin,&milk[i].End);
    sort(milk+1,milk+n+1,cmp);//sort排序一下 再加一个cmp
    int tmpend=milk[1].End   ,   max_at_least_1=milk[1].End-milk[1].Begin   ,   max_nobody=0;
    int at_least_1_tot=milk[1].End-milk[1].Begin;
    for(int i=2;i<=n;i++){
        if(milk[i].Begin<=tmpend){//区间相连
            if(milk[i].End>=tmpend)
                at_least_1_tot+=milk[i].End-tmpend;
            tmpend=max(tmpend,milk[i].End);
        }
        else{//有空隙 
            max_at_least_1=max(max_at_least_1,at_least_1_tot);//取最大值 
            at_least_1_tot=milk[i].End-milk[i].Begin;//还原重新累计 
            max_nobody=max(max_nobody,milk[i].Begin-tmpend);
            tmpend=max(tmpend,milk[i].End);
        }
    } 
    printf("%d %d", max_at_least_1 , max_nobody );
     
    return 0;
}