oj.uz

Submission #696609

# Submission time Handle Problem Language Result Execution time Memory
696609 2023-02-07T01:15:08 Z anhduc2701 Autići (COCI22_autici) C++17
50 / 50
 18 ms 1364 KB 
/*
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimize("unroll-loops")
*/
#include<bits/stdc++.h>
#define int long long
using namespace std;
#define all(x) x.begin(), x.end()
#define len(x) ll(x.size())
#define eb emplace_back
#define PI 3.14159265359
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define MIN(v) *min_element(all(v))
#define MAX(v) *max_element(all(v))
#define BIT(x,i) (1&((x)>>(i)))
#define MASK(x) (1LL<<(x))
#define task "tnc"  
typedef long long ll;
const ll INF=1e18;
const int maxn=1e6+5;
const int mod=1e9+7;
const int mo=998244353;
using pi=pair<ll,ll>;
using vi=vector<ll>;
using pii=pair<pair<ll,ll>,ll>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int n;
int a[maxn];
signed main()
{
	cin.tie(0),cout.tie(0)->sync_with_stdio(0);
    //freopen(task".inp" , "r" , stdin);
    //freopen(task".out" , "w" , stdout);
    cin>>n;

   	int sum=0;
   	for(int i=1;i<=n;i++){
   		cin>>a[i];
    }
    if(n==1){
    	cout<<0;	
    }
    else{
    	sort(a+1,a+1+n);
    	for(int i=2;i<=n;i++){
    		sum+=a[i]+a[1];
    	}
    	cout<<sum;
	}
    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 6 ms 1116 KB Output is correct
3 Correct 13 ms 1364 KB Output is correct
4 Correct 10 ms 1204 KB Output is correct
5 Correct 11 ms 1228 KB Output is correct
6 Correct 9 ms 1108 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 340 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 6 ms 1116 KB Output is correct
3 Correct 13 ms 1364 KB Output is correct
4 Correct 10 ms 1204 KB Output is correct
5 Correct 11 ms 1228 KB Output is correct
6 Correct 9 ms 1108 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 6 ms 1108 KB Output is correct
22 Correct 13 ms 1304 KB Output is correct
23 Correct 11 ms 1208 KB Output is correct
24 Correct 17 ms 1144 KB Output is correct
25 Correct 16 ms 1252 KB Output is correct
26 Correct 15 ms 1108 KB Output is correct
27 Correct 18 ms 1272 KB Output is correct
28 Correct 15 ms 1108 KB Output is correct
29 Correct 16 ms 1212 KB Output is correct
30 Correct 13 ms 1140 KB Output is correct