제출 #9786

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
9786	2014-09-28 08:55:50	silas	Uniting (kriii2_U)	C++98	0 / 4	20 ms	1676 KiB

U

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <iostream>
#include <queue>
#include <functional>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
  priority_queue<int, vector<int>, greater<int> > min_heap;
  vector<int> arr;
  int cost = 0; // 비용의 합의 최솟값
  int num, temp; // num : 부서의 수
  cin >> num;
  for (int i = 0 ; i < num; i++) {
    cin >> temp;
    arr.push_back(temp);
    min_heap.push(temp);
  }
  sort(arr.begin(), arr.end());
  while (arr.size() > 1) {
    cost += arr[0] * arr[arr.size() - 1];
    int tmp = arr[0] + arr[arr.size() - 1];
    arr.erase(arr.begin()); arr.pop_back();
    arr.push_back(tmp);
    sort(arr.begin(), arr.end());
  }
  int cost2 = 0;
  while (min_heap.size() > 1) {
    int tmp1 = min_heap.top(); min_heap.pop();
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 0 / 4