# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
783590 |
2023-07-15T04:37:39 Z |
cig32 |
Autići (COCI22_autici) |
C++17 |
|
15 ms |
2076 KB |
#include "bits/stdc++.h"
using namespace std;
#define int long long
const int MAXN = 1e6 + 10;
const int MOD = 998244353;
mt19937_64 rng((int)std::chrono::steady_clock::now().time_since_epoch().count());
int rnd(int x, int y) {
int u = uniform_int_distribution<int>(x, y)(rng); return u;
}
int bm(int b, int p) {
if(p==0) return 1 % MOD;
int r = bm(b, p >> 1);
if(p&1) return (((r*r) % MOD) * b) % MOD;
return (r*r) % MOD;
}
int inv(int b) {
return bm(b, MOD-2);
}
int fastlog(int x) {
return (x == 0 ? -1 : 64 - __builtin_clzll(x) - 1);
}
void printcase(int i) { cout << "Case #" << i << ": "; }
void solve(int tc) {
int n;
cin >> n;
int d[n+1];
for(int i=1; i<=n; i++) cin >> d[i];
sort(d+1, d+1+n);
int ans = 0;
for(int i=2; i<=n; i++) ans += d[1] + d[i];
cout << ans << "\n";
}
int32_t main() {
ios::sync_with_stdio(0); cin.tie(0);
int t = 1; //cin >> t;
for(int i=1; i<=t; i++) solve(i);
}
// 勿忘初衷
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
5 ms |
1236 KB |
Output is correct |
3 |
Correct |
9 ms |
2064 KB |
Output is correct |
4 |
Correct |
8 ms |
1824 KB |
Output is correct |
5 |
Correct |
9 ms |
2004 KB |
Output is correct |
6 |
Correct |
8 ms |
1796 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
320 KB |
Output is correct |
2 |
Correct |
1 ms |
320 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
340 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
6 |
Correct |
1 ms |
212 KB |
Output is correct |
7 |
Correct |
1 ms |
332 KB |
Output is correct |
8 |
Correct |
1 ms |
332 KB |
Output is correct |
9 |
Correct |
1 ms |
340 KB |
Output is correct |
10 |
Correct |
1 ms |
340 KB |
Output is correct |
11 |
Correct |
1 ms |
340 KB |
Output is correct |
12 |
Correct |
1 ms |
332 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
5 ms |
1236 KB |
Output is correct |
3 |
Correct |
9 ms |
2064 KB |
Output is correct |
4 |
Correct |
8 ms |
1824 KB |
Output is correct |
5 |
Correct |
9 ms |
2004 KB |
Output is correct |
6 |
Correct |
8 ms |
1796 KB |
Output is correct |
7 |
Correct |
0 ms |
320 KB |
Output is correct |
8 |
Correct |
1 ms |
320 KB |
Output is correct |
9 |
Correct |
1 ms |
212 KB |
Output is correct |
10 |
Correct |
1 ms |
340 KB |
Output is correct |
11 |
Correct |
1 ms |
212 KB |
Output is correct |
12 |
Correct |
1 ms |
212 KB |
Output is correct |
13 |
Correct |
1 ms |
332 KB |
Output is correct |
14 |
Correct |
1 ms |
332 KB |
Output is correct |
15 |
Correct |
1 ms |
340 KB |
Output is correct |
16 |
Correct |
1 ms |
340 KB |
Output is correct |
17 |
Correct |
1 ms |
340 KB |
Output is correct |
18 |
Correct |
1 ms |
332 KB |
Output is correct |
19 |
Correct |
1 ms |
212 KB |
Output is correct |
20 |
Correct |
0 ms |
320 KB |
Output is correct |
21 |
Correct |
5 ms |
1232 KB |
Output is correct |
22 |
Correct |
10 ms |
2076 KB |
Output is correct |
23 |
Correct |
9 ms |
2004 KB |
Output is correct |
24 |
Correct |
13 ms |
1876 KB |
Output is correct |
25 |
Correct |
14 ms |
2004 KB |
Output is correct |
26 |
Correct |
14 ms |
1900 KB |
Output is correct |
27 |
Correct |
14 ms |
1972 KB |
Output is correct |
28 |
Correct |
15 ms |
1884 KB |
Output is correct |
29 |
Correct |
14 ms |
1964 KB |
Output is correct |
30 |
Correct |
13 ms |
1996 KB |
Output is correct |