| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 528608 |
2022-02-20T18:10:40 Z |
Hacv16 |
Autići (COCI22_autici) |
C++17 |
|
16 ms |
1868 KB |
#include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC target("fma,sse,sse2,sse3,avx")
#pragma GCC optimize("unroll-loops")
#define endl '\n'
#define fr first
#define sc second
#define mp make_pair
#define pb push_back
#define bn binary_search
#define lb lower_bound
#define up upper_bound
#define np next_permutation
#define all(x) x.begin(), x.end()
#define sz(x) (int) x.size()
#define mdc(x, y) __gcd(x, y)
#define dbg(x) cout << #x << ": " << "[ " << x << " ]\n"
typedef int ii;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef priority_queue<int, vector<int>, greater<int>> heap;
const int MAX = 2e6 + 15;
const int MOD = 1e9 + 7;
const int INF = 0x3f3f3f3f;
const ll LLINF = 0x3f3f3f3f3f3f3f3f;
const int VAR[4] = {-1, 1, 0, 0};
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
ll n, ans = 0;
cin >> n;
ll mn = INF;
vector<ll> v(n);
for(auto &x : v){
cin >> x;
mn = min(mn, x);
}
ans += (n - 2) * mn;
for(auto x : v){
ans += x;
}
cout << ans << '\n';
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
204 KB |
Output is correct |
| 2 |
Correct |
6 ms |
972 KB |
Output is correct |
| 3 |
Correct |
15 ms |
972 KB |
Output is correct |
| 4 |
Correct |
10 ms |
1852 KB |
Output is correct |
| 5 |
Correct |
11 ms |
1348 KB |
Output is correct |
| 6 |
Correct |
11 ms |
1272 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
204 KB |
Output is correct |
| 2 |
Correct |
0 ms |
204 KB |
Output is correct |
| 3 |
Correct |
0 ms |
204 KB |
Output is correct |
| 4 |
Correct |
1 ms |
204 KB |
Output is correct |
| 5 |
Correct |
0 ms |
204 KB |
Output is correct |
| 6 |
Correct |
0 ms |
324 KB |
Output is correct |
| 7 |
Correct |
1 ms |
204 KB |
Output is correct |
| 8 |
Correct |
0 ms |
204 KB |
Output is correct |
| 9 |
Correct |
1 ms |
204 KB |
Output is correct |
| 10 |
Correct |
1 ms |
204 KB |
Output is correct |
| 11 |
Correct |
0 ms |
204 KB |
Output is correct |
| 12 |
Correct |
1 ms |
204 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
204 KB |
Output is correct |
| 2 |
Correct |
6 ms |
972 KB |
Output is correct |
| 3 |
Correct |
15 ms |
972 KB |
Output is correct |
| 4 |
Correct |
10 ms |
1852 KB |
Output is correct |
| 5 |
Correct |
11 ms |
1348 KB |
Output is correct |
| 6 |
Correct |
11 ms |
1272 KB |
Output is correct |
| 7 |
Correct |
0 ms |
204 KB |
Output is correct |
| 8 |
Correct |
0 ms |
204 KB |
Output is correct |
| 9 |
Correct |
0 ms |
204 KB |
Output is correct |
| 10 |
Correct |
1 ms |
204 KB |
Output is correct |
| 11 |
Correct |
0 ms |
204 KB |
Output is correct |
| 12 |
Correct |
0 ms |
324 KB |
Output is correct |
| 13 |
Correct |
1 ms |
204 KB |
Output is correct |
| 14 |
Correct |
0 ms |
204 KB |
Output is correct |
| 15 |
Correct |
1 ms |
204 KB |
Output is correct |
| 16 |
Correct |
1 ms |
204 KB |
Output is correct |
| 17 |
Correct |
0 ms |
204 KB |
Output is correct |
| 18 |
Correct |
1 ms |
204 KB |
Output is correct |
| 19 |
Correct |
1 ms |
312 KB |
Output is correct |
| 20 |
Correct |
0 ms |
204 KB |
Output is correct |
| 21 |
Correct |
10 ms |
1072 KB |
Output is correct |
| 22 |
Correct |
15 ms |
1092 KB |
Output is correct |
| 23 |
Correct |
11 ms |
1220 KB |
Output is correct |
| 24 |
Correct |
11 ms |
972 KB |
Output is correct |
| 25 |
Correct |
11 ms |
1108 KB |
Output is correct |
| 26 |
Correct |
11 ms |
1076 KB |
Output is correct |
| 27 |
Correct |
11 ms |
1080 KB |
Output is correct |
| 28 |
Correct |
13 ms |
1768 KB |
Output is correct |
| 29 |
Correct |
16 ms |
1868 KB |
Output is correct |
| 30 |
Correct |
13 ms |
1604 KB |
Output is correct |
