Submission #696614

#	Time	Username	Problem	Language	Result	Execution time	Memory
696614		LeDaiKing	Autići (COCI22_autici)	C++14	50 / 50	17 ms	988 KiB

Main

#include<bits/stdc++.h>

using namespace std;

#define NMOD 3
#define ll long long
#define fi first
#define se second
#define pb push_back
#define log 17
#define mask(i) (1ll << (i))
#define setp(x) setprecision(x)
#define ALL(v) v.begin(), v.end()
#define ck(n, i) (((n) >> (i)) & 1) 
#define getbit(x) __builtin_popcount(x)

const double PI = acos(-1);
const long long MOD = 1e9 + 7;
const long long MOD1 = 998244353;
const long long MODo = 123456789;

const int oo = 1e9;
const long long oo15 = 1e15, oo18 = 1e18+3, oooo = 922372036854775807;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int a[100005];

void solve() 
{
	int n;
	cin >> n;

	if (n == 1)
	{
		cout << 0; return;
	}

	ll sum = 0;

	for (int i = 1; i <= n; i++)
	{
		cin >> a[i];
		sum += a[i];
	}

	sort(a + 1, a + 1 + n);

	sum += 1ll*(n - 2)*a[1];

	cout << sum;

}

int main() 
{   
   
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);  
    int testcase = 1;
    //cin >> testcase;
    while(testcase--)
        solve();
}

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