#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#include <bits/stdc++.h>
using namespace std;
#define sqr 340
#define mid (l+r)/2
#define pb push_back
#define ppb pop_back
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define ins insert
#define era erase
#define C continue
#define mem(dp,i) memset(dp,i,sizeof(dp))
#define mset multiset
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pi;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pi> vpi;
typedef vector<pll> vpll;
const ll mod=1000000007;
const ll mod2=998244353;
const ll inf=1e18*4;
const ld pai=acos(-1);
int n;
ll a[100009];
int main(){
cin>>n;
ll sum=0;
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;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
504 KB |
Output is correct |
3 |
Correct |
2 ms |
376 KB |
Output is correct |
4 |
Correct |
2 ms |
376 KB |
Output is correct |
5 |
Correct |
3 ms |
380 KB |
Output is correct |
6 |
Correct |
44 ms |
1500 KB |
Output is correct |
7 |
Correct |
40 ms |
1528 KB |
Output is correct |
8 |
Correct |
41 ms |
1528 KB |
Output is correct |
9 |
Correct |
58 ms |
1656 KB |
Output is correct |
10 |
Correct |
58 ms |
1784 KB |
Output is correct |