oj.uz

답안 #915301

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
915301 2024-01-23T16:13:01 Z jpfr12 Akcija (COCI15_akcija) C++14
80 / 80
 13 ms 1876 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.rbegin(), vec.rend());
  ll sum = 0;
  if(n >= 3){
    for(int i = 0; i < n; i += 3){
      sum += vec[i];
      if(i+1 < n) sum += vec[i+1];
    }
  }
  else{
    for(ll& i: vec) sum += i;
  }
  cout << sum << '\n';
  return 0;
}

Subtask #1
80.0 / 80.0

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