제출 #915288

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
915288		jpfr12	Akcija (COCI15_akcija)	C++14	16 / 80	13 ms	1628 KiB

akcija

#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <string>
#include <map>
#include <math.h>
#include <cmath>
#include <climits>
#include <unordered_map>
#include <unordered_set>
#include <assert.h>
#include <fstream>
#include <bitset>
#include <iomanip>
 
typedef long long ll;
using namespace std;
int MOD = (int)1e9;
int MAXN = 1e6;
 
//classes

 
 
//global


int main(){
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  //ifstream fin("input.txt");
  //ofstream fout("output.txt");
  //stop
  int n;
  cin >> n;
  vector<ll> vec(n);
  for(ll& i: vec) cin >> i;
  sort(vec.begin(), vec.end());
  int left = 0, right = n-1;
  ll sum = 0;
  while(right-left+1 >= 3){
    sum += vec[right] + vec[left+1];
    right--;
    left += 2;
  }
  if(right-left+1 == 2) sum += vec[right] + vec[left];
  else if(right-left+1 == 1) sum += vec[right];
  cout << sum << '\n';
  return 0;
}

• Subtask 1: 16 / 80