xjtuoj 1264：视频质量

题目来源

题目分为两个任务，\(X\)是金典的区间全覆盖问题，\(Y\)是woshidashabi
注意区间是左闭右开所以判断取最远覆盖的时候用\(<\)

#include
#define F(i,n,m) for(ll i=n;im;i--)
//#define test
typedef unsigned long long ull;
typedef long long ll;
using namespace std;
struct PP {
	ll lp,rp;
} fc[200005];
inline ll read() {
	ll num = 0;
	char c;
	bool flag = false;
	while ((c = getchar()) == ' ' || c == '\n' || c == '\r');
	if (c == '-') flag = true;
	else
		num = c - '0';
	while (isdigit(c = getchar()))
		num = num * 10 + c - '0';
	return (flag ? -1 : 1) * num;
}
bool cmp(PP a,PP b) {
	if(a.lp==b.lp) return a.rp>b.rp;
	return a.lp