Submission

Status:

PPPPPPPPPPPPPPPPPPPP

Score: 100

User: Namkhing

Problemset: RANGEandMEAN

Language: cpp

Time: 0.002 second

Submitted On: 2025-04-11 16:13:18

#include <bits/stdc++.h>
using namespace std;

using ll = long long;
const ll inf = 1e18;

const int N = 110;
ll n, a[N];

int main() {
    cin.tie(nullptr)->ios_base::sync_with_stdio(false);
    cin >> n;
    for (int i = 0; i < n; i++) cin >> a[i];
    ll sum = 0, mx = -inf, mn = inf;
    for (int i = 0; i < n; i++) {
        sum += a[i];
        mx = max(mx, a[i]);
        mn = min(mn, a[i]);
    }
    printf("%lld %.2lf", mx - mn, (double) sum / n);
}