# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1257405 | kaitou | Autići (COCI22_autici) | C++20 | 25 ms | 1164 KiB |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ll N;
cin >> N;
vector <ll> mobil(N);
ll x = 1000000000;
for(int i = 0; i < N; i++){
cin >> mobil[i];
if ( x > mobil[i]) x = mobil[i];
}
ll hasil = 0;
for(int i = 0; i < N ; i++){
hasil += x + mobil[i];
}
cout << hasil - x * 2 << endl;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |