HDU 1587 Flowers【简单题】 Flowers

103 阅读 0 评论 68 点赞

我是靠谱客的博主暴躁大米，最近开发中收集的这篇文章主要介绍HDU 1587 Flowers【简单题】 Flowers，觉得挺不错的，现在分享给大家，希望可以做个参考。

概述

/*
中文题目花
题目大意：n种花，m块钱，求解最多可以买多少朵花
解题思路：排序，找出最便宜的花，在用总价钱除以最便宜的单价
解题人：lingnichong
解题时间：2014-09-03 22:20:34
解题体会：简单题
*/

Flowers

Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)

Total Submission(s): 2779 Accepted Submission(s): 1856

Problem Description

As you know, Gardon trid hard for his love-letter, and now he's spending too much time on choosing flowers for Angel.
When Gardon entered the flower shop, he was frightened and dazed by thousands kinds of flowers.
"How can I choose!" Gardon shouted out.
Finally, Gardon-- a no-EQ man decided to buy flowers as many as possible.
Can you compute how many flowers Gardon can buy at most?

Input

Input have serveral test cases. Each case has two lines.
The first line contains two integers: N and M. M means how much money Gardon have.
N integers following, means the prices of differnt flowers.

Output

For each case, print how many flowers Gardon can buy at most.
You may firmly assume the number of each kind of flower is enough.

Sample Input

Sample Output

  
  
   
   2


   
   
    
    
     
     Hint
    
    Hint
   
   
   
    
Gardon can buy 5=2+3,at most 2 flower, but he cannot buy 3 flower with 5 yuan.

#include<stdio.h> 
#include<algorithm>
using namespace std;
int a[10000];
int main()
{
    int n,m;
    int i,j;
    while(~scanf("%d%d",&n,&m))
    {
        for(i=0;i<n;i++)
        scanf("%d",&a[i]);
        sort(a,a+n);
        printf("%dn",m/a[0]);
    }    
    return 0;
}