# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
449370 |
2021-08-02T05:59:20 Z |
dz001 |
Akcija (COCI15_akcija) |
C++11 |
|
19 ms |
1264 KB |
/* ldmm is n00b */
#include <bits/stdc++.h>
using namespace std;
#define Cerr cerr << "\nTest: "
#define endl "\n"
#define fi first
#define se second
#define pb push_back
#ifdef RICARDO
#define bug(x) cerr << #x << " = " << (x) << endl;
#define block if(1)
#else
#define bug(x) "IDINGO"
#define block if(0)
#endif
template<class T> bool mini(T &a, T b) { return a > b ? (a = b, true) : false; }
template<class T> bool maxi(T &a, T b) { return a < b ? (a = b, true) : false; }
typedef pair<int, int> pii;
typedef long long ll;
typedef double ld;
const int N=1e5+10;
int a[N];
int n;
signed main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.precision(10);
cout << fixed;
#ifdef LOCAL
freopen("i", "r", stdin);
freopen("o", "w", stdout);
#endif
cin>>n;
for(int i=0;i<n;++i)cin>>a[i];
sort(a,a+n,greater<int>());
ll ans=0;
for(int i=0;i<n;++i){
if(i%3==2)continue;
ans+=a[i];
}
cout<<ans;
#ifdef LOCAL
cerr << "\nTime elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
204 KB |
Output is correct |
4 |
Correct |
0 ms |
204 KB |
Output is correct |
5 |
Correct |
1 ms |
332 KB |
Output is correct |
6 |
Correct |
16 ms |
1048 KB |
Output is correct |
7 |
Correct |
10 ms |
1096 KB |
Output is correct |
8 |
Correct |
10 ms |
1100 KB |
Output is correct |
9 |
Correct |
19 ms |
1228 KB |
Output is correct |
10 |
Correct |
18 ms |
1264 KB |
Output is correct |