답안 #902447

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
902447 2024-01-10T12:20:08 Z HamzaT Autići (COCI22_autici) C++14
10 / 50
10 ms 3544 KB
//struct Edge {int u, v, weight;bool operator<(Edge const& other) {return weight < other.weight;}};
#include <bits/stdc++.h>
#define endl "\n"
#define ll long long
#define sp ' '
#define pb push_back
#define ar for(int i=1;i<=n;i++)
using namespace std;
ll t=1;
const ll N=3e5+100;
ll n,m,q,k;
ll a[N];
ll ans=0;
void solve()
{
    ans=0;
    cin>>n;
    ar{cin>>a[i];}
    sort(a+1,a+n+1);
    if(n==1){cout<<ans<<endl;return;}
    for(int i=1;i<=n-2;i++)
    {
        ans+=(a[i]*2);
    }
    ans+=a[n-1]+a[n];
    cout<<ans<<endl;return;
}
int main()
{
    //freopen("shell.in", "r", stdin);
   // freopen("shell.out", "w", stdout);
    ios::sync_with_stdio(NULL);
    cin.tie(NULL);cout.tie(NULL);
     //cin>>t;
    while(t--){solve();}
    return 0;
}
//09:00 :: 9:45
//10:30 ::
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 360 KB Output is correct
2 Correct 5 ms 2664 KB Output is correct
3 Correct 9 ms 3544 KB Output is correct
4 Correct 8 ms 3448 KB Output is correct
5 Correct 10 ms 3476 KB Output is correct
6 Correct 10 ms 3420 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 356 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Incorrect 1 ms 348 KB Output isn't correct
7 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 360 KB Output is correct
2 Correct 5 ms 2664 KB Output is correct
3 Correct 9 ms 3544 KB Output is correct
4 Correct 8 ms 3448 KB Output is correct
5 Correct 10 ms 3476 KB Output is correct
6 Correct 10 ms 3420 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 356 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Incorrect 1 ms 348 KB Output isn't correct
13 Halted 0 ms 0 KB -