oj.uz

답안 #168873

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
168873 2019-12-16T18:57:52 Z Asamu13 Akcija (COCI15_akcija) C++14
80 / 80
 22 ms 2036 KB 
#include<bits/stdc++.h>
#define inf INT_MAX
#define sc(a) scanf("%d",&a)
#define scc(a,b) scanf("%d %d",&a,&b)
#define sccc(a,b,c) scanf("%d %d %d",&a,&b,&c)
#define pf(a) printf("%d",a)
#define pff(a,b) printf("%d %d",a,b)
#define pfff(a,b,c) printf("%d %d %d",a,b,c)
#define pb(a) push_back(a)
#define em empty()
#define fr front()
#define cl clear()
#define sz size()
#define mp(a,b) make_pair(a,b)
#define fri(b) freopen(b,"r",stdin)
#define fro(b) freopen(b,"w",stdout)
/*
ID: uslusam1
TASK: test
LANG: C++
*/
 
 
using namespace std;

vector<long long> vec;
long long ans;

int main(){
	//fri("gir.txt");
	//fro("cik.txt");
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
	int n;
	cin>>n;
	for(int i=1;i<=n;i++){
		long long k;
		cin>>k;
		vec.pb(k);
	}
	sort(vec.begin(),vec.end());
	int cnt=0;
	for(int i=vec.size()-1;i>=0;i--){
		if(cnt%3!=2){
			ans+=vec[i];
		}
		cnt++;
	}
	cout<<ans;


	return 0;
}

Subtask #1
80.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 18 ms 1908 KB Output is correct
7 Correct 13 ms 1908 KB Output is correct
8 Correct 14 ms 1908 KB Output is correct
9 Correct 22 ms 2036 KB Output is correct
10 Correct 22 ms 2036 KB Output is correct