Submission

Score: 30

User: qweqwe

Problemset: โดรน

Language: cpp

Time: 0.007 second

Submitted On: 2026-10-09 10:13:31

/*
						 :::=
                        .:.:.
                        :.-
                  .:-:..:=-=.:--:.
                -:.................:-.
             =.........................-
          :::........................:..:
      .-::=...    ............:.......:==-=::
   ==-:::=.    ....:......:....:........=+-:::=
	    :    .::...-.....::..............==:.....
       ..  ...=...-:..:..::..............=+:....=
       : ....::..- ::.:..: .:.....:.....-.--....:.
       -::...=:::.  =.:..-   =.....=.....:-=:...:.
      .::....=####+.:-:..-    :=-::::....:==:...:
      .:::..:=. =++*:.::.:. : .=+-===....:-=:...-
       -:+..-= .===:-  =:.- -=++===*=...:+==::..=
       ::+..--  :..:.   :-: :===:= *-...+-.-::..=
    	===.:=             - ...-   :..-=  -::..:.
         :::.:-                    -..:-   -::...:
            ::  ::                 :.-     =::...-
             :      :-:.     ..:: =.=     --::....:
                    .-==*+==--   ::       =::.....-
                   -:+==:=== :-.          ---......:
                  ###==+.===+ :+.        =:-=:...:.:
                =***#=+:.====#**#:       --:=:...-.::
               #***+===..====+**##-     -:.-:...:+:.-
             .==##=====-+======#= *+    =  =:...: =:-
             : -=.-====:-====-=##=:#+  :  :-:..=   .==
                 =######*#==##*#*-= =     -:.::
                 -=#.  #  #*###*--.-:    =:::
                   .===+=-+===+.        :=.
                    :    :-  =:.
                    :====:-..=#.
                     #***::*###
                     *###..#**#
                     --=. .***-
*/
#include <bits/stdc++.h>
#define akneru cin.tie(0)->sync_with_stdio(0)
using namespace std;
using ll = long long;
using pii = pair<ll,ll>;
using vi = vector<ll>;
using vvi = vector<vector<ll>>;
using db = long double;

const ll INF = 1e18;

int main(){
	akneru;
	int n;cin >> n;
	vi arr(n);
	for (int i=0;i<n;i++) cin >> arr[i];
	sort(arr.begin(),arr.end(),greater<ll>());
	vvi dp(n+1,vi(201,INF));
	dp[0][0]=0;
	for (ll i=0;i<n;i++){
		for (ll k=0;k<200;k++){
			ll sum=0,mx=0;
			if (dp[i][k]==INF) continue;
			for (int l=1;l<=10;l++){
				if (i+l-1>=n) break;
				sum+=arr[i+l-1];
				mx=max(mx,arr[i+l-1]);
				dp[i+l][k+1]=min(dp[i+l][k+1],dp[i][k]+2LL*(k+1)*sum-(k+1)*mx);
			}
		}	
	}
	ll ans=INF;
	for (int j=0;j<=200;j++){
		ans=min(ans,dp[n][j]);
	}
	/*
	for (int i=0;i<=n;i++){
		for (int j=0;j<=200;j++){
			if (dp[i][j]!=INF)cout << dp[i][j] << " ";
			else cout << -1 << " ";
		}cout << "\n";
	}
	*/
	cout << ans;
	return 0;
}