【计算机考研机试指南】第七章 贪心策略：Senior‘s GUN

#include <iostream>
#include <cstdio>
#include <algorithm>

using namespace std;

const int MAXN = 1000;

long long gun[MAXN];
long long monster[MAXN];

bool Compare(long long x, long long y){
	return x > y;		//从大到小排序 
}

int main(int argc, char** argv) {
	int caseNumber;
	cin >> caseNumber;
	
	while(caseNumber--){
		int n, m;
		cin >> n >> m;
		for(int i = 0; i < n; i++){
			cin >> gun[i]; 
		}
		for(int i = 0; i < m; i++){
			cin >> monster[i];
		}
		sort(gun, gun + n, Compare);	//枪的攻击力从大到小排序 
		sort(monster, monster + m);		//怪物攻击力从小到大排序 
		
		long long answer = 0;
		for(int i = 0; i < n; i++){
			if(i >= m || gun[i] <= monster[i]){
				break;
			}
			answer += (gun[i] - monster[i]);
		} 
		printf("%lld\n", answer);
	}	

	return 0;
}