| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1234579 | AlgorithmWarrior | Autići (COCI22_autici) | C++20 | 26 ms | 416 KiB |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
int i;
long long sum=0;
int minim=1e9;
for(i=1;i<=n;++i){
int val;
cin>>val;
sum+=val;
if(val<minim)
minim=val;
}
sum-=minim;
cout<<sum+1LL*(n-1)*minim;
return 0;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
