CodeForces Gym 100685C Cinderella (水题)

题意：给定 n 个杯子，里面有不同体积的水，然后问你要把所有的杯子的水的体积都一样，至少要倒少多少个杯子。

析：既然最后都一样，那么先求平均数然后再数一下，哪个杯子的开始的体积就大于平均数，这是一定要倒的。

代码如下：

#pragma comment(linker, "/STACK:1024000000,1024000000")

#include <cstdio>

#include <string>

#include <cstdlib>

#include <cmath>

#include <iostream>

#include <cstring>

#include <set>

#include <queue>

#include <algorithm>

#include <vector>

#include <map>

#include <cctype>

#include <cmath>

#include <stack>

#define frer freopen("in.txt", "r", stdin)

#define frew freopen("out.txt", "w", stdout)

using namespace std;

typedef long long LL;

typedef pair<int, int> P;

const int INF = 0x3f3f3f3f;

const double inf = 0x3f3f3f3f3f3f;

const double PI = acos(-1.0);

const double eps = 1e-8;

const int maxn = 1e3 + 5;

const int mod = 1e9 + 7;

const char *mark = "+-*";

const int dr[] = {-1, 0, 1, 0};

const int dc[] = {0, 1, 0, -1};

const char *de[] = {"0000", "0001", "0010", "0011", "0100", "0101", "0110", "0111", "1000", "1001", "1010", "1011", "1100", "1101", "1110", "1111"};

int n, m;

const int mon[] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};

const int monn[] = {0, 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};

inline int Min(int a, int b){ return a < b ? a : b; }

inline int Max(int a, int b){ return a > b ? a : b; }

inline LL Min(LL a, LL b){ return a < b ? a : b; }

inline LL Max(LL a, LL b){ return a > b ? a : b; }

inline bool is_in(int r, int c){

    return r >= 0 && r < n && c >= 0 && c < m;

}

double a[maxn];

int main(){

    while(scanf("%d", &n) == 1){

        double s = 0.0, x;

        for(int i = 0; i < n; ++i){

            scanf("%lf", &a[i]);

            s += a[i];

        }

        s = s / (1.0*n);

        int ans = 0;

        for(int i = 0; i < n; ++i){

            if(a[i] > s)  ++ans;

        }

        printf("%d\n", ans);

    }

    return 0;

}