题意:
聘请能力值大于等于恶龙的骑士杀恶龙,按照能力值付金币,使金币尽量少.水题,一键sort.
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
int dra[20005];
int kni[20005];
int n, m;
int main() {
while(scanf("%d%d", &n, &m) != EOF && n && m) {
for(int i=0; i<n; i++)
scanf("%d", &dra[i]);
for(int j=0; j<m; j++) scanf("%d", &kni[j]);
sort(dra, dra+n); sort(kni, kni+m);
if(n>m) {
printf("Loowater is doomed!\n");
continue;
}
int i, j, sum=0;
for( i=0,j=0; i<n&&j<m; j++) {
if(dra[i] <= kni[j]) {
i++;
sum += kni[j];
}
}
if(i==n) printf("%d\n", sum);
else printf("Loowater is doomed!\n");
}
return 0;
}