제출 #1294357

#제출 시각아이디문제언어결과실행 시간메모리
1294357Hamed_GhaffariAutići (COCI22_autici)C++20
50 / 50
13 ms588 KiB
#include <bits/stdc++.h>
using namespace std;

using ll  = long long;
using ld  = long double;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
using ull = unsigned long long;

#ifdef HAMED
#define DB 1
#else
#define DB 0
#endif
#define debug           if(DB) cout
#define X               first
#define Y               second
#define SZ(x)           int(x.size())
#define all(x)          x.begin(), x.end()
#define mins(a,b)       (a = min(a,b))
#define maxs(a,b)       (a = max(a,b))
#define Mp              make_pair
#define lc              id<<1
#define rc              lc|1
#define mid             ((l+r)>>1)
mt19937_64              rng(chrono::steady_clock::now().time_since_epoch().count());

const ll  INF = 1e9 + 23;
const ll  MOD = 1e9 + 7;
const int MXN = 1e6 + 5;
const int LOG = 23;


void Main() {
    int n;
    cin >> n;
    vector<int> d(n);
    for(int &i : d) cin >> i;
    sort(all(d));
    ll ans = 1ll*(n-2)*d[0];
    for(int i : d) ans += i;
    cout << ans << '\n';
}

int32_t main() {
    cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0);
    int T = 1;
    // cin >> T;
    while(T--) Main();
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...