POJ-3646-The Dragon of Loowater
2013-03-15 10:32
337 查看
比较典型的贪心题, 尽量找到能力值最小的骑士去杀死恶龙。
#include<cstdio> #include<cstring> #include<iostream> #include<algorithm> #define MAX 20001 using namespace std; int n,m,a[MAX],b[MAX]; int main() { while(scanf("%d%d",&n,&m)&&(n||m)) { for(int i=0;i<n;i++) scanf("%d",&a[i]); for(int i=0;i<m;i++) scanf("%d",&b[i]); sort(a,a+n); sort(b,b+m); int ans=0,cou=0,i; for(i=0;i<n;i++) { while(cou<m&&b[cou]<a[i]) cou++; if(cou<m) ans+=b[cou++]; else break; } if(i==n) printf("%d\n",ans); else printf("Loowater is doomed!\n"); } return 0; }
相关文章推荐
- 白皮书:The Dragon of Loowater, UVa 11292,POJ 3646
- POJ - 3646 The Dragon of Loowater(贪心)
- POJ 3646 The Dragon of Loowater
- poj 3646 The Dragon of Loowater 排序+贪心
- POJ 3646 The Dragon of Loowater G++
- POJ 3646 The Dragon of Loowater
- poj 3646 The Dragon of Loowater
- 周赛 POJ 3546 The Dragon of Loowater
- POJ 3646 Dragon of Loowater
- hdu 1092 The Dragon of Loowater
- UVA11292 The Dragon of Loowater
- UVa 11292 The Dragon of Loowater (贪心)
- uva11292 The Dragon of Loowater (排序+贪心)
- UVA 11292 The Dragon of Loowater(排序问题系列)
- UVA11292 The Dragon of Loowater
- UVA 11292 The Dragon of Loowater
- sicily 1459. The Dragon of Loowater
- The Dragon of Loowater
- uva11292 - The Dragon of Loowater (贪心)
- UVa 11292 The Dragon of Loowater