답안 #676276

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
676276 2022-12-30T05:13:52 Z Tangirkul Autići (COCI22_autici) C++17
10 / 50
12 ms 1192 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] * 2;
    }
    if (n == 1)
    {
        cout << 0;
        return;
    }
    sort (d + 1, d + n + 1);
    sum -= d[n];
    sum -= d[n - 1];
    cout << sum;
}
    
int main ()
{
    Junanna;
    ll t = 1;
    while (t--)
    {
        ma1n ();
    }
    return 0;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 316 KB Output is correct
2 Correct 6 ms 1192 KB Output is correct
3 Correct 12 ms 1184 KB Output is correct
4 Correct 9 ms 1108 KB Output is correct
5 Correct 10 ms 1108 KB Output is correct
6 Correct 9 ms 1108 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 316 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 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 Incorrect 1 ms 212 KB Output isn't correct
7 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 316 KB Output is correct
2 Correct 6 ms 1192 KB Output is correct
3 Correct 12 ms 1184 KB Output is correct
4 Correct 9 ms 1108 KB Output is correct
5 Correct 10 ms 1108 KB Output is correct
6 Correct 9 ms 1108 KB Output is correct
7 Correct 1 ms 316 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 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 Incorrect 1 ms 212 KB Output isn't correct
13 Halted 0 ms 0 KB -