Submission #1185184

#	Time	Username	Problem	Language	Result	Execution time	Memory
1185184		Haciyev12	Autići (COCI22_autici)	C++20	50 / 50	11 ms	1168 KiB

Main

#include "bits/stdc++.h"
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ll long long
#define pb push_back
#define in insert
#define F first
#define S second
#define vll vector<ll>
#define all(v) v.begin(),v.end()
#define rep(a, b, c) for (int(a) = (b); (a) < (c); (a)++)//i, 0, n
#define endl '\n'
#define pii pair<ll,ll>
#define yes cout << "Yes" << endl;
#define no cout << "No" << endl;
using namespace std;
const ll INF = 1e18, mod = 1e9 + 7, N = 3e5 + 5;
ll gcd(ll a, ll b) {
    return b == 0 ? a : gcd(b, a % b);
}
ll lcm(ll a, ll b) {
    return (a / gcd(a, b)) * b;
}
ll modpow(ll a, ll b){
    ll ans = 1;
    while(b > 0){
        if(b % 2 == 1){
            ans *= a;
            ans = ans%mod;
        }
        a *= a;
        a %= mod;
        b = b >> 1;
    }
    return ans % mod;
}
ll inv(ll a){
    return (modpow(a,mod-2)) % mod;
}

void solve(){
    ll n;
    cin >> n;
    ll x;
    if(n == 1){
        cin >> x;
        cout << 0 << endl;
        return;
    }
    vll v(n);
    for(int i = 0; i < n; i++){
        cin >> v[i];
    }
    sort(all(v));
    ll sum = 0;
    for(int i = 1; i < n; i++){
       sum += v[0] + v[i];
    }

    cout << sum << endl;

}
int main() {
    fast;
    ll t = 1;
//    cin >> t;
    
    while (t--) {
        solve();
    }
}

• Subtask 1: 10 / 10
• Subtask 2: 20 / 20
• Subtask 3: 20 / 20