# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
604126 | Hussein3600 | Akcija (COCI15_akcija) | C++14 | 0 ms | 0 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<bits/stdc++.h>
using namespace std ;
typedef long long ll ;
int main()
{
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int n ;
cin >> n ;
int a[n] , total=0 , best ;
for(int i=0;i<n;i++)cin>>a[i] ,total+=a[i];
sort(a,a+n) ;
best=total ;
for(int i=0;i<n;i+=3)total-=a[i] ;
for(int i=0;i<n;i++)best-=a[i] ;
if(n%3==0)total+=a[n-1];
if(n%2)
}