hdoj 3420 bus Fair

??

Bus Fair

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 897 Accepted Submission(s): 442

 

Problem Description You are now in Foolish Land. Once moving in Foolish Land you found that there is a strange Bus fair system. The fair of moving one kilometer by bus in that country is one coin. If you want to go to X km and your friend wants to go to Y km then you can buy a ticket of X+Y coins (you are also allowed to buy two or more tickets for you two).

Now as a programmer, you want to show your creativity in buying tickets! Suppose, your friend wants to go 1 km and you want to go 2 km. Then it’s enough for you to buy a 2coin ticket! Because both of you are valid passengers before crossing the first km. and when your bus cross the first km your friend gets down from the bus. So you have the ticket of 2km! And you can safely reach to your destination, 2km using that ticket.

Now, you have a large group of friends and they want to reach to different distance. You think that you are smart enough that you can buy tickets that should manage all to reach their destination spending the minimum amount of coins. Then tell us how much we should at least pay to reach our destination.

 

Input There are multiple test cases. Each case start with a integer n, the total number of people in that group. 0<=n<=1000. Then comes n integers, each of them stands for a distance one of the men of the group wants to go to. You can assume that the distance a man wants to go is always less than 10000.

 

Output Your program should print a single integer for a single case, the minimum amount of coins the group should spend to reach to the destination of all the members of that group.

 

Sample Input

2
1
2
2
2
3

 

Sample Output

2
4

 

#include
#include
int cmp(const void *a,const void *b)
{
return *(int *)a-*(int *)b;
}
int main()
{
int x[1001],n,i,j,max;
while(~scanf(%d,&n))
{
for(i=0;i scanf(%d,x+i);
qsort(x,n,sizeof(x[0]),cmp);
max=0;
for(i=0;i if(x[i]*(n-i)>max)
max=x[i]*(n-i);
printf(%d ,max);
}
return 0;
}

 

??