#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
int n, a, i = 0, t = 0;
cin >> n;
vector<int> b(n);
for (int i = 0; i < n; i++)
cin >> b[i];
sort(b.begin(), b.end());
a = n % 3;
while (i < a && i < n) {
t += b[i];
i++;
}
while (i < n) {
t += b[i+1] + b[i+2];
i += 3;
}
cout << t << '\n';
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
364 KB |
Output is correct |
2 |
Correct |
1 ms |
364 KB |
Output is correct |
3 |
Correct |
1 ms |
364 KB |
Output is correct |
4 |
Correct |
1 ms |
364 KB |
Output is correct |
5 |
Correct |
1 ms |
364 KB |
Output is correct |
6 |
Correct |
15 ms |
896 KB |
Output is correct |
7 |
Correct |
10 ms |
748 KB |
Output is correct |
8 |
Correct |
13 ms |
748 KB |
Output is correct |
9 |
Correct |
19 ms |
748 KB |
Output is correct |
10 |
Correct |
19 ms |
748 KB |
Output is correct |