HDU1587-Flowers

Flowers

                                                                             Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
                                                                                                        Total Submission(s): 3983    Accepted Submission(s): 2630

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

  
  

   
   2 5
2 3
   
    
  
  

Sample Output

  
  

   
   2


   
   

    
    

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

Author

DYGG  

Source

HDU “Valentines Day” Open Programming Contest 2007-02-14

 

题意：有n种花和m的钱，求最多可以买多少花的数量

解题思路：只要买最便宜的花就行了。

#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <queue>
#include <stack>
#include <vector>
#include <set>
#include <map>

using namespace std;

#define LL long long
const int INF=0x3f3f3f3f;

int main()
{
    int n,m,x,mi;
    while(~scanf("%d %d",&n,&m))
    {
        mi=INF;
        for(int i=1;i<=n;i++)
        {
            scanf("%d",&x);
            mi=min(mi,x);
        }
        printf("%d\n",m/mi);
    }
    return 0;
}