Submission #630858

#	Time	Username	Problem	Language	Result	Execution time	Memory
630858		Chal1shkan	Autići (COCI22_autici)	C++14	50 / 50	43 ms	1060 KiB

Main

# include <bits/stdc++.h>

# define mkp make_pair
# define ff first
# define ss second
# define pll pair <ll, ll>
# define pii pair <int, int>
 
# define vec vector
# define pb push_back
# define pf push_front
# define ppb pop_back
# define ppf pop_front

# define all(x) (x).begin(), (x).end()
# define rall(x) (x).rbegin(), (x).rend()
# define sz(x) ((int)(x).size())
# define lb lower_bound
# define ub upper_bound

# define br break
# define rt return 
# define cn continue
# define nl "\n"
# define off exit(0)

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;

const ll MAXN = 3e5 + 25;
const ll MAXL = 18 + 0;
const ll INF1 = 1e18 + 0;
const ll INF2 = 2e9 + 0;
const ll MOD = 1e9 + 7;
const ll M0D = 998244353;
const ld PI = acos((ld) -1);
const ll P = 67 + 0 + 0;
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};

using namespace std;

void ma1n ()
{
	ll n;
	cin >> n;
	ll a[n + 3];
	ll sum = 0, mn = INF1;
	for (ll i = 1; i <= n; ++i)
	{
		cin >> a[i];
		sum += a[i];
		mn = min(mn, a[i]);
	}
	ll ans = sum + mn * (n - 2);
	cout << ans << nl;
}
	
int main (/*?*/)
{	
	int zxc = 1;
//	cin >> zxc;
	while (zxc--)
	{
		ma1n();
	}
    return 0;
}

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