摘要： http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=3322最小区间覆盖，排序加上贪心。#include <iostream> #include <algorithm> #include <cstdio>using namespace std;struct SetNode{ int a; int b;}mySet[5010];int n;int minPoint;int maxPoint;bool cmp(SetNode a, SetNode b){ if(a.a != b.a) return 阅读全文