hdoj 1070 milk

最新推荐文章于 2016-08-03 20:27:04 发布

原创最新推荐文章于 2016-08-03 20:27:04 发布 · 661 阅读

0 ·

CC 4.0 BY-SA版权

|--hdoj 专栏收录该内容

134 篇文章

订阅专栏

本文深入探讨了AI音视频处理领域中的视频分割与语义识别技术，介绍了其在自动驾驶、AR增强现实等场景的应用，以及在实现过程中所涉及的关键算法与实践案例。

http://acm.hdu.edu.cn/showproblem.php?pid=1070

Milk

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 13526 Accepted Submission(s): 3296

Problem Description

Ignatius drinks milk everyday, now he is in the supermarket and he wants to choose a bottle of milk. There are many kinds of milk in the supermarket, so Ignatius wants to know which kind of milk is the cheapest.

Here are some rules:
1. Ignatius will never drink the milk which is produced 6 days ago or earlier. That means if the milk is produced 2005-1-1, Ignatius will never drink this bottle after 2005-1-6(inclusive).
2. Ignatius drinks 200mL milk everyday.
3. If the milk left in the bottle is less than 200mL, Ignatius will throw it away.
4. All the milk in the supermarket is just produced today.

Note that Ignatius only wants to buy one bottle of milk, so if the volumn of a bottle is smaller than 200mL, you should ignore it.
Given some information of milk, your task is to tell Ignatius which milk is the cheapest.

Input

The input contains several test cases. The first line of the input is a single integer T which is the number of test cases. T test cases follow.
Each test case starts with a single integer N(1<=N<=100) which is the number of kinds of milk. Then N lines follow, each line contains a string S(the length will at most 100 characters) which indicate the brand of milk, then two integers for the brand: P(Yuan) which is the price of a bottle, V(mL) which is the volume of a bottle.

Output

For each test case, you should output the brand of the milk which is the cheapest. If there are more than one cheapest brand, you should output the one which has the largest volume.

Sample Input

  
   2
2
Yili 10 500
Mengniu 20 1000
4
Yili 10 500
Mengniu 20 1000
Guangming 1 199
Yanpai 40 10000

Sample Output

  
   Mengniu
Mengniu
  
  
   #include<stdio.h>
struct Things
{
	char S[200];
	double P;//单价要用double型，以为算每日消费时可能得到小数，不能只取整 
	int V;
}thing[200];
int main()
{
	int T,N,i,j,k;
	double M;
    scanf("%d",&T);
	while(T--)
	{
	      scanf("%d",&N);
		  for(i=0,j=0;i<N;i++)
		  {
		     scanf("%s %d %d",thing[j].S,&thing[j].P,&thing[j].V);
		     if(thing[j].V>=200)
		     j+=1;
		 }
		 //printf("%d#\n",j);
		 for(i=1,k=0,M=thing[0].P/(thing[0].V/200);i<j;i++)
		 {
		 	if(thing[i].V/200<=5)
		 	{
		 	   if(M>thing[i].P/(thing[i].V/200))
		 	   {
				  M=thing[i].P/(thing[i].V/200);
				  k=i;
			   }
			   if(M==thing[i].P/(thing[i].V/200)&&thing[i].V>thing[k].V)
			   {
			   	  k=i;
			   }
		    }
		    else if(thing[i].V/200>5)
		    {
		    	if(M>thing[i].P/5)
		    	{
		    		M=thing[i].P/5;
		    		k=i;
		    	}
		    }
		     
		 }
		 printf("%s\n",thing[k].S);
	}
	return 0;
}