Submission #615273

#	Time	Username	Problem	Language	Result	Execution time	Memory
615273		ak2006	Autići (COCI22_autici)	C++14	50 / 50	45 ms	2056 KiB

Main

#include <bits/stdc++.h>
using namespace std;
int main()
{
	int n;
	cin>>n;

	long long sum = 0;//ll because the values of d[i] can be upto 1e9

	vector<long long>d(n + 1);
	for (int i = 1;i<=n;i++)cin>>d[i];
	sort(d.begin() + 1,d.end());//in-built sort operation

	for (int i = 1;i<=n;i++)
		sum += d[i];

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

	//because d is sorted => d[1] is the SMALLEST element

	cout<<sum;

	return 0;
}

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