ZOJ 3508 The War(贪心)

首先对士兵按照maxx排序.

然后对于每一个士兵,选择满足[minxi,maxxi]的最小武器.

#include <iostream>
#include <algorithm>
#include <memory.h>
#include <cstdio>
#include <set>
using namespace std;
const int maxn=2501;

struct sol{
	int minx, maxx;
	sol(){
		minx = 0;
		maxx = 0;
	}
	bool operator < (const sol & rhs)const{
		return maxx < rhs.maxx || (maxx == rhs.maxx && minx < rhs.minx);
	}
}sls[maxn];
int N, M;
int main(){
	while (scanf("%d %d", &N, &M) == 2){
		multiset<int> tree;
		multiset<int>::iterator it;
		for (int i = 0; i < N; ++i){
			scanf("%d %d", &sls[i].minx, &sls[i].maxx);
		}
		for (int i = 0; i < M; ++i){
			int t;
			scanf("%d", &t);
			tree.insert(t);
		}
		
		int ans = 0;
		sort(sls, sls + N);
		for (int i = 0; i < N; ++i){
			it = tree.lower_bound(sls[i].minx);
			if(it != tree.end() && *it <= sls[i].maxx){
				tree.erase(it);
				ans++;
			}
		}
		printf("%d\n", ans);
	}
}