zoukankan      html  css  js  c++  java
  • (周日赛)The Trip

    题意:求平均值,注意精度

    A number of students are members of a club that travels annually to exotic locations. Their destinations in the past have included Indianapolis, Phoenix, Nashville, Philadelphia, San Jose, and Atlanta. This spring they are planning a trip to Eindhoven.
    The group agrees in advance to share expenses equally, but it is not practical to have them share every expense as it occurs. So individuals in the group pay for particular things, like meals, hotels, taxi rides, plane tickets, etc. After the trip, each student's expenses are tallied and money is exchanged so that the net cost to each is the same, to within one cent. In the past, this money exchange has been tedious and time consuming. Your job is to compute, from a list of expenses, the minimum amount of money that must change hands in order to equalize (within a cent) all the students' costs.
    Input
    Standard input will contain the information for several trips. The information for each trip consists of a line containing a positive integer, n, the number of students on the trip, followed by n lines of input, each containing the amount, in dollars and cents, spent by a student. There are no more than 1000 students and no student spent more than $10,000.00. A single line containing 0 follows the information for the last trip.
    Output
    For each trip, output a line stating the total amount of money, in dollars and cents, that must be exchanged to equalize the students' costs.
    Sample Input
    3
    10.00
    20.00
    30.00
    4
    15.00
    15.01
    3.00
    3.01
    0


    Sample Output
    $10.00
    $11.99

     1 #include<stdio.h>
     2 #include<algorithm>
     3 #include<math.h>
     4 using namespace std;
     5 int main()
     6 {
     7     int n,i;
     8     double a[1001];
     9     while(~scanf("%d",&n)&&n)
    10     {
    11         double sum=0.0;
    12         double ave=0.0;
    13         for(i=0;i<n;i++)
    14         {
    15             scanf("%lf",&a[i]);
    16             sum+=a[i];
    17         }
    18         ave=((int)((sum/n+0.005)*100))*1.0/100;//四舍五入  
    19         double sum1=0.0,sum2=0.0;
    20         for(i=0;i<n;i++)
    21         {
    22             if(a[i]<ave)
    23             {
    24                 sum1+=ave-a[i];
    25             }
    26             else
    27             {
    28                  sum2+=a[i]-ave;
    29             }
    30         }
    31         double minn=min(sum1,sum2);
    32         printf("$%.2lf
    ",minn);
    33     }
    34     return 0;
    35 }
  • 相关阅读:
    JAVA中的SimpleDateFormat yyyy和YYYY的区别
    Mysql的MVCC
    SELECT语句中的for update的用法(锁的运用)
    今天简单说一下cdc 的使用
    sqlserver cdc用法
    JAVA | Java对象的内存分配过程是如何保证线程安全的?
    物联网(莹石云)WIFI一键配置原理分析(zz)
    Dell xps 13 9350待机时总是关机的处理方法
    Vue系列:在vux的popup组件中使用百度地图遇到显示不全的问题
    如何通过百度地图将经纬度转换为地址信息
  • 原文地址:https://www.cnblogs.com/awsent/p/4280479.html
Copyright © 2011-2022 走看看