Submission #307109

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
307109	2020-09-27T06:00:14 Z	Hemimor	Akcija (COCI15_akcija)	C++14	80 / 80	63 ms	1304 KB

akcija

#include <algorithm>
#include <iostream>
#include <iomanip>
#include <numeric>
#include <cassert>
#include <vector>
#include <random>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#define syosu(x) fixed<<setprecision(x)
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef pair<double,double> pdd;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<string> vs;
typedef vector<P> vp;
typedef vector<vp> vvp;
typedef vector<pll> vpll;
typedef pair<int,P> pip;
typedef vector<pip> vip;
const int inf=1<<30;
const ll INF=1ll<<60;
const double pi=acos(-1);
const double eps=1e-8;
const ll mod=998244353;
const int dx[4]={-1,0,1,0},dy[4]={0,-1,0,1};

vi vin(int n,int d=0){
	vi a(n);
	for(auto &i:a){
		cin>>i;
		i-=d;
	}
	return a;
}

vvi gin(int n,int m,int d=1){
	vvi g(n);
	for(int i=0;i<m;i++){
		int u,v;
		cin>>u>>v;
		u-=d,v-=d;
		g[u].push_back(v);
		g[v].push_back(u);
	}
	return g;
}

const int M=1000001;
int n,b[M];
vi a;

int main(){
	cin>>n;
	a=vin(n);
	sort(a.rbegin(),a.rend());
	ll res=0;
	for(int i=0;i<n;i++) if(i%3<2) res+=a[i];
	cout<<res<<endl;
}

Subtask #1

80.0 / 80.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	256 KB	Output is correct
2	Correct	1 ms	256 KB	Output is correct
3	Correct	1 ms	384 KB	Output is correct
4	Correct	1 ms	256 KB	Output is correct
5	Correct	1 ms	384 KB	Output is correct
6	Correct	47 ms	1152 KB	Output is correct
7	Correct	43 ms	1152 KB	Output is correct
8	Correct	44 ms	1160 KB	Output is correct
9	Correct	63 ms	1304 KB	Output is correct
10	Correct	61 ms	1268 KB	Output is correct