| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 524353 | blue | Akcija (COCI15_akcija) | C++17 | 16 ms | 2424 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
using ll = long long;
using vll = vector<ll>;
const ll INF = 1'000'000'000'000LL;
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int N;
	cin >> N;
	vll C(1+N, 0);
	for(int i = 1; i <= N; i++) cin >> C[i];
	sort(C.begin(), C.end());
	vll dp(1+N, INF);
	dp[0] = 0;
	for(int i = 1; i <= N; i++)
	{
		dp[i] = dp[i-1] + C[i];
		if(i >= 3)
		{
			dp[i] = min(dp[i], dp[i-3] + C[i] + C[i-1]);
		}
	}
	cout << dp[N] << '\n';
}
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
