Submission #1306223

#TimeUsernameProblemLanguageResultExecution timeMemory
1306223muhammad-ahmadAkcija (COCI15_akcija)C++20
80 / 80
12 ms1212 KiB
// #include <bits/stdc++.h> #include <iostream> #include <cmath> #include <algorithm> #include <map> #include <vector> #include <iomanip> #include <string> #include <queue> #include <set> #include <deque> #include <numeric> #include <stack> #include <chrono> using namespace std; void fast_io(){ // freopen("", "r", stdin); // freopen("", "w", stdout); ios::sync_with_stdio(0); cin.tie(); cout.tie(); cout << setprecision(9); } #define int long long #define endl '\n' #define all(v) (v).begin(), (v).end() #define rall(v) (v).rbegin(), (v).rend() #define fi first #define se second void solve() { int n; cin >> n; int sum = 0, a[n + 1]; for (int i = 1; i <= n; i++){ cin >> a[i]; sum += a[i]; } sort(a + 1, a + n + 1); reverse(a + 1, a + n + 1); for (int i = 3; i <= n; i += 3) sum -= a[i]; cout << sum << endl; return; } signed main() { fast_io(); srand(chrono::steady_clock::now().time_since_epoch().count()); int tc = 1; // cin >> tc; while (tc--) solve(); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...