zoukankan      html  css  js  c++  java
  • Codeforces 758A Holiday Of Equality

    A. Holiday Of Equality
    time limit per test
    1 second
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    In Berland it is the holiday of equality. In honor of the holiday the king decided to equalize the welfare of all citizens in Berland by the expense of the state treasury.

    Totally in Berland there are n citizens, the welfare of each of them is estimated as the integer in ai burles (burle is the currency in Berland).

    You are the royal treasurer, which needs to count the minimum charges of the kingdom on the king's present. The king can only give money, he hasn't a power to take away them.

    Input

    The first line contains the integer n (1 ≤ n ≤ 100) — the number of citizens in the kingdom.

    The second line contains n integers a1, a2, ..., an, where ai (0 ≤ ai ≤ 106) — the welfare of the i-th citizen.

    Output

    In the only line print the integer S — the minimum number of burles which are had to spend.

    Examples
    input
    5
    0 1 2 3 4
    output
    10
    input
    5
    1 1 0 1 1
    output
    1
    input
    3
    1 3 1
    output
    4
    input
    1
    12
    output
    0
    Note

    In the first example if we add to the first citizen 4 burles, to the second 3, to the third 2 and to the fourth 1, then the welfare of all citizens will equal 4.

    In the second example it is enough to give one burle to the third citizen.

    In the third example it is necessary to give two burles to the first and the third citizens to make the welfare of citizens equal 3.

    In the fourth example it is possible to give nothing to everyone because all citizens have 12 burles.

     

    题意:为了公平,最少需要多少福利,每个人都要最多的那个人手里的钱就OK了。

     1 #include <bits/stdc++.h>
     2 
     3 using namespace std;
     4 
     5 const int maxn = 1000000 + 5;
     6 
     7 int n;
     8 int a[maxn];
     9 
    10 int main()
    11 {
    12 
    13     scanf("%d",&n);
    14     int mmax = -1;
    15     for(int i=0;i<n;i++) {
    16         scanf("%d",&a[i]);
    17         mmax = max(mmax,a[i]);
    18     }
    19 
    20     int sum = 0;
    21     for(int i=0;i<n;i++) {
    22         sum += (mmax-a[i]);
    23     }
    24 
    25     printf("%d
    ",sum);
    26 
    27     return 0;
    28 }
    A. Holiday Of Equality
    time limit per test
    1 second
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    In Berland it is the holiday of equality. In honor of the holiday the king decided to equalize the welfare of all citizens in Berland by the expense of the state treasury.

    Totally in Berland there are n citizens, the welfare of each of them is estimated as the integer in ai burles (burle is the currency in Berland).

    You are the royal treasurer, which needs to count the minimum charges of the kingdom on the king's present. The king can only give money, he hasn't a power to take away them.

    Input

    The first line contains the integer n (1 ≤ n ≤ 100) — the number of citizens in the kingdom.

    The second line contains n integers a1, a2, ..., an, where ai (0 ≤ ai ≤ 106) — the welfare of the i-th citizen.

    Output

    In the only line print the integer S — the minimum number of burles which are had to spend.

    Examples
    input
    5
    0 1 2 3 4
    output
    10
    input
    5
    1 1 0 1 1
    output
    1
    input
    3
    1 3 1
    output
    4
    input
    1
    12
    output
    0
    Note

    In the first example if we add to the first citizen 4 burles, to the second 3, to the third 2 and to the fourth 1, then the welfare of all citizens will equal 4.

    In the second example it is enough to give one burle to the third citizen.

    In the third example it is necessary to give two burles to the first and the third citizens to make the welfare of citizens equal 3.

    In the fourth example it is possible to give nothing to everyone because all citizens have 12 burles.

  • 相关阅读:
    powershell查看版本信息
    Vue资源
    【踩坑经历】SQLSTATE[HY000] [2002] Connection refused
    获取文件指定行数的内容
    《Redis高阶应用》讲座总结
    Lua入门记录
    使用docker搭建OpenResty开发环境
    基于Openresty+Naxsi的WAF:从小白到实践
    获取指定开始行数$start,跨度$limit的文件内容
    获取文件的行数
  • 原文地址:https://www.cnblogs.com/TreeDream/p/6322650.html
Copyright © 2011-2022 走看看