oj.uz

답안 #39421

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
39421 2018-01-15T02:52:09 Z adamczh1 Akcija (COCI15_akcija) C++14
80 / 80
 16 ms 2408 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int,int> pii;

#define SIZE(x) (int)(x).size()
#define ALL(x) (x).begin(),(x).end()
#define ff first
#define ss second

inline ll readi(){
	ll x=0,f=1;char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
	return x*f;
}

int main(){
	int N=readi();
	vector<int> c(N);
	for(int i=0;i<N;i++){
		c[i]=readi();
	}
	sort(c.begin(),c.end());
	reverse(c.begin(),c.end());
	ll ans=0;
	while(SIZE(c)%3) {
		ans+=c.back();
		c.pop_back();
	}
	while(SIZE(c)){
		c.pop_back();
		ans+=c.back();
		c.pop_back();
		ans+=c.back();
		c.pop_back();
	}
	cout<<ans<<endl;
	return 0;
}

Subtask #1
80.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2016 KB Output is correct
2 Correct 0 ms 2016 KB Output is correct
3 Correct 0 ms 2016 KB Output is correct
4 Correct 0 ms 2016 KB Output is correct
5 Correct 0 ms 2016 KB Output is correct
6 Correct 9 ms 2408 KB Output is correct
7 Correct 6 ms 2408 KB Output is correct
8 Correct 6 ms 2408 KB Output is correct
9 Correct 16 ms 2408 KB Output is correct
10 Correct 13 ms 2408 KB Output is correct