[USACO1.2]挤牛奶Milking Cows--贪心

Luogu 1204

题目分析:

• 将时间段看成线段，按$l$排序后分情况讨论

Code:

#include <bits/stdc++.h>
using namespace std;
#define maxn 5010

int n,ans_1=0,ans_2=0;
struct node {
   
	int l,r;
}a[maxn];

inline void init_() {
   
	freopen("a.txt","r",stdin);
}<