Lightoj1227——Boiled Eggs(贪心)
2016-04-16 18:04
281 查看
Three of the trouble-makers went to Malaysia this year. A rest house was booked for them. Unlike other rest houses, this rest house was like a normal duplex house. So, it
had
a kitchen. And the trouble-makers were given all the ingredients to cook, but they had to cook themselves.
None of them had any previous cooking experience, but they became very excited and planned to cook so many delicious foods! Ideas were coming from their minds like rains from clouds. So, they went to the super market and bought a lot of extra ingredients
for their great recipes. For example, they bought 20 eggs. The excited trouble-makers returned to the rest house and found that the gas stove was not connected to the gas cylinder. So, they became very sad, because it was not possible for
them to connect such complex thing. And so many foods were about to be rotten. But luckily, they found the microwave oven working. So, they tried to boil all the eggs using the microwave oven (may be, first time in history)! And they succeeded to boil the
eggs!
Now they have n eggs and a bowl. They put some eggs in the bowl with some water. And after that they put the bowl into the oven to boil the eggs. It's risky to put more than P eggs in the bowl and the bowl can carry at most Q gm
of eggs. It takes 12 minutes to boil a bowl of eggs. Now you are given the weight of the eggs in gm, and the trouble-makers have exactly 12 minutes in their hand. You have to find the maximum number of eggs they can boil without
taking any risk.
Each case starts with three integers n (1 ≤ n ≤ 30), P (1 ≤ P ≤ 30) and Q (1 ≤ Q ≤ 30). The next line contains n positive integers (not greater than 10) in non-descending
order. These integers denote the weight of the eggs in gm.
要求是蛋的个数最多,所以选择的鸡蛋的重量尽可能小。子问题的最优解符合全局的最优解,所以可以用贪心算法
#include<stdio.h>
#include<algorithm>
#include<string.h>
#include<iostream>
#include<cmath>
#define MAXN 10000
using namespace std;
int main()
{
int p,q,a[100],sum;
int t,cnt=1,i,j,m,n;
scanf("%d",&t);
while(t--)
{
scanf("%d%d%d",&n,&p,&q);
for(i=0; i<n; ++i)
cin>>a[i];
sum=j=0;
for(i=0; i<n; ++i)
{
if(sum+a[i]<=q&&i+1<=p)
{
sum+=a[i];
j++;
}
else
break;
}
printf("Case %d: %d\n",cnt++,j);
}
return 0;
}
had
a kitchen. And the trouble-makers were given all the ingredients to cook, but they had to cook themselves.
None of them had any previous cooking experience, but they became very excited and planned to cook so many delicious foods! Ideas were coming from their minds like rains from clouds. So, they went to the super market and bought a lot of extra ingredients
for their great recipes. For example, they bought 20 eggs. The excited trouble-makers returned to the rest house and found that the gas stove was not connected to the gas cylinder. So, they became very sad, because it was not possible for
them to connect such complex thing. And so many foods were about to be rotten. But luckily, they found the microwave oven working. So, they tried to boil all the eggs using the microwave oven (may be, first time in history)! And they succeeded to boil the
eggs!
Now they have n eggs and a bowl. They put some eggs in the bowl with some water. And after that they put the bowl into the oven to boil the eggs. It's risky to put more than P eggs in the bowl and the bowl can carry at most Q gm
of eggs. It takes 12 minutes to boil a bowl of eggs. Now you are given the weight of the eggs in gm, and the trouble-makers have exactly 12 minutes in their hand. You have to find the maximum number of eggs they can boil without
taking any risk.
Input
Input starts with an integer T (≤ 100), denoting the number of test cases.Each case starts with three integers n (1 ≤ n ≤ 30), P (1 ≤ P ≤ 30) and Q (1 ≤ Q ≤ 30). The next line contains n positive integers (not greater than 10) in non-descending
order. These integers denote the weight of the eggs in gm.
Output
For each case, print the case number and the desired result.Sample Input | Output for Sample Input |
2 3 2 10 1 2 3 4 5 5 4 4 5 5 | Case 1: 2 Case 2: 1 |
#include<stdio.h>
#include<algorithm>
#include<string.h>
#include<iostream>
#include<cmath>
#define MAXN 10000
using namespace std;
int main()
{
int p,q,a[100],sum;
int t,cnt=1,i,j,m,n;
scanf("%d",&t);
while(t--)
{
scanf("%d%d%d",&n,&p,&q);
for(i=0; i<n; ++i)
cin>>a[i];
sum=j=0;
for(i=0; i<n; ++i)
{
if(sum+a[i]<=q&&i+1<=p)
{
sum+=a[i];
j++;
}
else
break;
}
printf("Case %d: %d\n",cnt++,j);
}
return 0;
}
相关文章推荐
- NOIP2013普及组 T2 表达式求值
- Apache 日志切割工具cronolog详解
- tcpdump抓包工具
- 进度条06
- 团队项目及项目介绍
- [JavaScript/JQuery] js数组去重的4个方法
- ubuntu 安装vmware
- RSA加密历史由来
- nodejs爬虫编码问题
- 【转】Android应用程序窗口(Activity)窗口对象(Window)创建指南
- 【杭电oj】1225 - Football Score(结构体排序)
- Android之WebViewClient与WebChromeClient的区别
- div+css之清除浮动
- 浏览器内核
- QT编程之——使用全局变量
- 20145107 《Java程序设计》第二次实验报告
- js 空数组是true还是false
- Vim练级攻略
- 简单Java 多表联查分页显示(初)
- 20145107 《Java程序设计》第七周学习总结