Uva 1065

点击打开链接

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;

const int N = 10000 + 5;
struct wood {
	int l;
	int w;
}p[N];
int vis[N];
int cmp (wood a ,wood b) {
	if(a.l != b.l) 
	    return a.l < b.l;
	return a.w < b.w;
}
int main () {
		int c;
		int n;
		scanf("%d",&c);
		while (c--) {
			int t = 0;
			int ll ;
			int ww ;
			scanf("%d",&n);
			memset(vis, 0 ,sizeof(vis));
			for (int i = 0 ; i < n ;i++) {
				scanf("%d%d",&p[i].l ,&p[i].w);
			}
			sort(p , p + n ,cmp);
			for (int i = 0 ;i < n ;i++) {
				if (!vis[i]) {
					vis[i] = 1;
					t++;
					ll = p[i].l;
					ww = p[i].w;
					for (int j = i; j < n;j++) {
						if (!vis[j] &&p[j].l >= ll && p[j].w >= ww) {
							vis[j] = 1;
							ll = p[j].l;
							ww = p[j].w;
						}
					}
				}
			}
			printf("%d\n",t);
		}
}