UVA10020 Minimal coverage ---- 贪心

题意：给n个（n<100000）闭区间和M（M<5000），在n个区间中找出最少的区间个数完全覆盖【0，M】区间，并输出选择的所有区间

题解： 具体参考 https://www.cnblogs.com/get-an-AC-everyday/p/4515133.html 

#include <cstdio>
#include <cstring>
#include <algorithm>
#define INF 100000000
#define MAXN 100010
using namespace std;
int T;
int m,n;
int path[MAXN];
struct Node {
  int l,r;
  bool operator < (const Node &n) const {
    if(l!=n.l) return l < n.l;
    return r < n.r;
  }
} e[MAXN];


int main() {
  scanf("%d",&T);
  while(T--) {
    scanf("%d",&m);
    n = 0;
    while(scanf("%d%d",&e[n].l,&e[n].r) == 2) {
      if(e[n].l==0&&e[n].r==0) break;
      n++;
    }
    sort(e,e+n);
    bool ok = true;
    int cur = 0,id = -1, maxn = -INF;
    int tot = 0;
    int j = 0;
    for(int i = 0;i < n;i++) {
      for(;j < n;j++) {
        if(e[j].l > cur) break;
        if(e[j].l <= cur && e[j].r > cur) {
          if(e[j].r > maxn) {
            maxn = e[j].r;
            id = j;
          }
        }
      }
      if(id == -1) {
        ok = false;
        break;
      }
      path[tot++] = id;
      cur = e[id].r;
      id = -1;
      maxn = -INF;
      if(cur >= m) {
        break;
      }

    }
    if(!ok) printf("0\n");
    else {
      printf("%d\n",tot);
      for(int i = 0;i < tot;i++) 
        printf("%d %d\n",e[path[i]].l,e[path[i]].r);
    }

  }


  return 0;
}