贪心/思维题 UVA 11292 The Dragon of Loowater

题目传送门

 /*
     题意：n个头，m个士兵，问能否砍掉n个头
     贪心/思维题：两个数组升序排序，用最弱的士兵砍掉当前的头
 */
 #include <cstdio>
 #include <cstring>
 #include <algorithm>
 using namespace std;

 const int MAXN = 2e4 + ;
 const int INF = 0x3f3f3f3f;
 int a[MAXN], b[MAXN];

 int main(void)        //UVA 11292 The Dragon of Loowater
 {
 //    freopen ("A.in", "r", stdin);

     int n, m;
     while (scanf ("%d%d", &n, &m) == )
     {
         if (n ==  && m == )    break;
         for (int i=; i<=n; ++i)    scanf ("%d", &a[i]);
         for (int i=; i<=m; ++i)    scanf ("%d", &b[i]);

         sort (a+, a++n);
         sort (b+, b++m);

         int ans = ;
         int i = , j = ;
         while (i <= n && j <= m)
         {
             if (a[i] <= b[j])    {ans += b[j];    i++; j++;}
             else    j++;
         }

         if (i == n +  && j <= m + )    printf ("%d\n", ans);
         else    puts ("Loowater is doomed!");
     }

     return ;
 }

 /*
 Loowater is doomed!
 */

/*题意：n个头，m个士兵，问能否砍掉n个头    贪心/思维题：两个数组升序排序，用最弱的士兵砍掉当前的头*/#include <cstdio>#include <cstring>#include <algorithm>using namespace std;
const int MAXN = 2e4 + 10;const int INF = 0x3f3f3f3f;int a[MAXN], b[MAXN];
int main(void)//UVA 11292 The Dragon of Loowater{//freopen ("A.in", "r", stdin);
int n, m;while (scanf ("%d%d", &n, &m) == 2){if (n == 0 && m == 0)break;for (int i=1; i<=n; ++i)scanf ("%d", &a[i]);for (int i=1; i<=m; ++i)scanf ("%d", &b[i]);
sort (a+1, a+1+n);sort (b+1, b+1+m);
int ans = 0;int i = 1, j = 1;while (i <= n && j <= m){if (a[i] <= b[j]){ans += b[j];i++; j++;}elsej++;}
if (i == n + 1 && j <= m + 1)printf ("%d\n", ans);elseputs ("Loowater is doomed!");}
return 0;}
/*Loowater is doomed!*/