oj.uz

답안 #915292

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
915292 2024-01-23T15:58:33 Z jpfr12 Akcija (COCI15_akcija) C++14
16 / 80
 15 ms 1116 KB 
#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;
  if(n == 1){
    cout << vec[0] << '\n';
    return 0;
  }
  sort(vec.begin(), vec.end());
  int left = 0, right = n-1;
  ll sum = 0;
  while(left+1 < right){
    sum += vec[right] + vec[left+1];
    right--;
    left += 2;
  }
  if(left+1 == right) sum += vec[right] + vec[left];
  else if(left == right) sum += vec[right];
  cout << sum << '\n';
  return 0;
}

Subtask #1
16.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Incorrect 1 ms 344 KB Output isn't correct
4 Incorrect 1 ms 344 KB Output isn't correct
5 Incorrect 0 ms 348 KB Output isn't correct
6 Incorrect 10 ms 1116 KB Output isn't correct
7 Correct 7 ms 1116 KB Output is correct
8 Correct 7 ms 1116 KB Output is correct
9 Incorrect 13 ms 1116 KB Output isn't correct
10 Incorrect 15 ms 1116 KB Output isn't correct