# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
919147 | 2024-01-31T11:28:45 Z | TIN | Akcija (COCI15_akcija) | C++17 | 13 ms | 1628 KB |
#include <bits/stdc++.h> using namespace std; #define FNAME "test" typedef long long ll; const int N = 1e5 + 5; int n; ll a[N]; ll res = 0; void Task() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cout << fixed << setprecision(9); if (fopen(FNAME".inp","r")) { freopen(FNAME".inp","r",stdin); freopen(FNAME".out","w",stdout); } } void Solve() { //Your Code cin >> n; for (int i = 1; i <= n; i++) cin >> a[i]; sort(a + 1, a + n + 1, greater<int>()); for (int i = 1; i <= n; i++) { if (i % 3 != 0) res += a[i]; } cout << res << '\n'; } int main() { Task(); Solve(); cerr << "\nTime run: " << 1000*clock()/CLOCKS_PER_SEC << "ms"; return 37^37; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Correct | 0 ms | 344 KB | Output is correct |
5 | Correct | 1 ms | 344 KB | Output is correct |
6 | Correct | 12 ms | 1624 KB | Output is correct |
7 | Correct | 7 ms | 1624 KB | Output is correct |
8 | Correct | 8 ms | 1624 KB | Output is correct |
9 | Correct | 13 ms | 1624 KB | Output is correct |
10 | Correct | 13 ms | 1628 KB | Output is correct |