勇者鬥惡龍：
https://uva.onlinejudge.org/external/112/11292.pdf
把龍的頭直徑從小到大排序，順次砍，把騎士的能力值從小到大排序，順次上，不行就不雇傭。
如果龍的頭還沒被砍完，且能力最強的騎士已經不能選了（已上場一次或被跳過了），那麼就輸了。
<span style="font-size:18px;">int n,m;
int head[maxn],knight[maxn];
ll work()
{
int i,j;
ll ans=0;
for( i=1,j=1;i<=n;i++,j++)
{
if(j>m ) return -1;
while(knight[j]<head[i]) j++;
ans+=knight[j];
}
return ans;
}
int main()
{
while(~scanf("%d%d",&n,&m)&&(n||m))
{
for(int i=1;i<=n;i++)
scanf("%d",&head[i]);
for(int i=1;i<=m;i++)
scanf("%d",&knight[i]);
sort(head+1,head+1+n);
sort(knight+1,knight+1+m);
ll ans;
if( (ans=work())>=0 ) printf("%lld\n",ans);
else puts("Loowater is doomed!") ;
}
return 0;
}
</span>
頭檔案：
<span style="font-size:18px;">#include<cstdio>
#include<string>
#include<cstring>
#include<iostream>
#include<cmath>
#include<algorithm>
#include<climits>
#include<queue>
#include<vector>
#include<map>
#include<sstream>
#include<set>
#include<stack>
#include<utility>
#pragma comment(linker, "/STACK:102400000,102400000")
#define PI 3.1415926535897932384626
#define eps 1e-10
#define sqr(x) ((x)*(x))
#define FOR0(i,n) for(int i=0 ;i<(n) ;i++)
#define FOR1(i,n) for(int i=1 ;i<=(n) ;i++)
#define FORD(i,n) for(int i=(n) ;i>=0 ;i--)
#define lson num<<1,le,mid
#define rson num<<1|1,mid+1,ri
#define MID int mid=(le+ri)>>1
#define zero(x)((x>0? x:-x)<1e-15)
#define mk make_pair
#define _f first
#define _s second
using namespace std;
const int INF =0x3f3f3f3f;
const int maxn=20000+10 ;
//const int maxm= ;
//const int INF= ;
typedef long long ll;
const ll inf =1000000000000000;//1e15;
//ifstream fin("input.txt");
//ofstream fout("output.txt");
//fin.close();
//fout.close();
//freopen("a.in","r",stdin);
//freopen("a.out","w",stdout);
//by yskysker123</span>