mysql下如何执行sql脚本
2015-10-29 14:06
525 查看
The Dragon of Loowater
Once upon a time, in the Kingdom of Loowater, a minor nuisance turnedinto a major problem. The shores of Rellau Creek in central Loowater had always been a primebreeding ground for geese. Due to the lack of predators, the geesepopulation was out of control. The people of Loowater mostly kept clearof the geese. Occasionally, a goose would attack one of the people,and perhaps bite off a finger or two, but in general, the peopletolerated the geese as a minor nuisance.One day, a freak mutation occurred, and one of the geese spawned amulti-headed fire-breathing dragon. When the dragon grew up, he threatenedto burn the Kingdom of Loowater to a crisp. Loowater had a major problem.The king was alarmed, andcalled on his knights to slay the dragon and save the kingdom.
The knights explained: "To slay the dragon, we must chop off all itsheads. Each knight can chop off one of the dragon's heads. The headsof the dragon are of different sizes. In order to chop off a head,a knight must be at least as tall as the diameter of the head.The knights' union demands that for chopping off a head, a knightmust be paid a wage equal to one gold coin for each centimetreof the knight's height."
Would there be enough knights to defeat the dragon? The king called onhis advisors to help him decide how many and which knights to hire.After having lost a lot of money building Mir Park, the king wantedto minimize the expense of slaying the dragon. As one of the advisors,your job was to help the king. You took it very seriously: if you failed,you and the whole kingdom would be burnt to a crisp!
Input Specification:
The input contains several test cases. The first line of each test casecontains two integers between 1 and 20000 inclusive, indicating thenumbern of heads that the dragon has, and the number mof knights in the kingdom. The nextn lines each contain aninteger, and give the diameters of the dragon's heads, in centimetres.The followingm lines each contain an integer, and specifythe heights of the knights of Loowater, also in centimetres.The last test case is followed by a line containing:
0 0
Output Specification:
For each test case, output a line containing the minimum number ofgold coins that the king needs to pay to slay the dragon. If it is notpossible for the knights of Loowater to slay the dragon, output theline:Loowater is doomed!
Sample Input:
2 3 5 4 7 8 4 2 1 5 5 10 00
Output for Sample Input:
11 Loowater is doomed! 解题思路:贪心算法,尽量节省钱,每个头都检索勇士,由价钱从低到高,能完成,则交个他任务,否则,无法杀死龙。本文出自 “try it” 博客,请务必保留此出处http://huahua520amy.blog.51cto.com/6729449/1373702#include<cstdio> #include<algorithm> using namespace std; int main() { int n,m; int i,j; int sum,sum1; int dra[20002],nam[20002]; while(scanf("%d%d",&n,&m)&&n||m) { sum=0; sum1=0; for(i=0;i<n;i++) scanf("%d",&dra[i]); sort(dra,dra+n); for(j=0;j<m;j++) scanf("%d",&nam[j]); sort(nam,nam+m); j=0; for(i=0;i<n;i++) for(;j<m;j++) //由大到小,逐个比较,能用则用,尽量节省 if(dra[i]<=nam[j]) { sum++; sum1+=nam[j]; j++; break; } if(sum==n) printf("%d\n",sum1); else printf("Loowater is doomed!\n"); } return 0; }
相关文章推荐
- jdbc&&mysql
- MySql数据库主从同步配置(参考)
- 忘记mysql root用户密码
- 彻底解决mysql中文乱码的办法,修改mysql解压缩版(免安装版或zip版)字符编码
- MySQL全世界最流行的开源数据库软件
- MySql学习笔记_01_安装、建表
- mysql优化(2) 观察mysql进程状态
- 三个流行MySQL分支的对比
- 自己写的通过ADO操作mysql数据库
- xampp里mysql数据库结构一直加载,如何在mysql页面创建自增id
- mysql 如何用一条SQL将一张表里的数据插入到另一张表 3个例子
- mysql 导入导出.sql文件
- mysql 循环插入日期递增
- mysql 编译安装
- mysql常用函数
- Mysql行锁与表锁
- mysql命令
- HandlerSocket安装
- mysql开启自启动
- MySQL Replication, 主从和双主配置