oj.uz

Submission #615272

# Submission time Handle Problem Language Result Execution time Memory
615272 2022-07-31T08:09:41 Z ak2006 Autići (COCI22_autici) C++14
0 / 50
 1 ms 212 KB 
#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 - 1) * d[1];

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

	cout<<sum;

	return 0;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -