oj.uz

Submission #676282

# Submission time Handle Problem Language Result Execution time Memory
676282 2022-12-30T06:22:16 Z Tangirkul Autići (COCI22_autici) C++17
50 / 50
 17 ms 2124 KB 
#include<bits/stdc++.h>
  
#define ll long long
#define fi first
#define se second
#define pb push_back
#define sz size
#define Junanna ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
  
using namespace std;
  
const ll K = 32;
const ll INF = 1e9 + 7;
const ll MOD = 1e9 + 7;
const ll N = (1e5 + 125);

void ma1n ()
{
    ll n;
    cin >> n;
    ll sum = 0;
    ll d[n + 7];
    for (ll i = 1; i <= n; i++)
    {
        cin >> d[i];
        sum += d[i];
    }
    if (n == 1)
    {
        cout << 0;
        return;
    }
    sort (d + 1, d + n + 1);
    sum -= d[1];
    sum += (n - 1) * d[1];
    cout << sum;
}
    
int main ()
{
    Junanna;
    ll t = 1;
    while (t--)
    {
        ma1n ();
    }
    return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 7 ms 1056 KB Output is correct
3 Correct 12 ms 1056 KB Output is correct
4 Correct 9 ms 980 KB Output is correct
5 Correct 11 ms 980 KB Output is correct
6 Correct 9 ms 980 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 328 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 316 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 6 ms 1228 KB Output is correct
22 Correct 13 ms 2124 KB Output is correct
23 Correct 12 ms 1980 KB Output is correct
24 Correct 17 ms 1920 KB Output is correct
25 Correct 17 ms 1972 KB Output is correct
26 Correct 15 ms 1868 KB Output is correct
27 Correct 16 ms 2004 KB Output is correct
28 Correct 17 ms 1780 KB Output is correct
29 Correct 17 ms 2016 KB Output is correct
30 Correct 15 ms 1996 KB Output is correct