UVA11292-The Dragon of Loowater

題意：給出龍的頭數和頭的數值，勇士的人數和需要用的錢，求出國王話費最少的錢才能將龍殺死，也可能殺不死

思路：先將兩個數組排序，然後進行比較就可以了

#include<stdio.h>#include<algorithm>#include<iostream>#include<string.h>using namespace std;int main(){int n, m;while(scanf("%d %d", &n, &m) && n && m){int arr1[20005], arr2[20005];for(int i = 0; i < n; i++)scanf("%d", &arr1[i]);for(int i = 0; i < m; i++)scanf("%d", &arr2[i]);if(n > m){printf("Loowater is doomed!\n");continue;}sort(arr1, arr1 + n);sort(arr2, arr2 + m);if(arr1[n - 1] > arr2[m - 1]){printf("Loowater is doomed!\n");continue;}int sum = 0, k = 0, i;for(i = 0; i < n; i++){if(k >= m)break;while(k < m && arr1[i] > arr2[k])k++;if(k >= m)break;sum += arr2[k]; k++;}if(i < n)printf("Loowater is doomed!\n");elseprintf("%d\n", sum);}return 0;}