Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
add all
#include <iostream> #include <queue> using namespace std; int main() { priority_queue <long long> nums; long long n; cin >> n; long long number = 0; for (int i = 0; i < n; i++) { cin >> number; nums.push(-number); } long long min_sum = 0; long long a = 0; long long b = 0; while ( !nums.empty() ) { a = nums.top(); nums.pop(); if (nums.empty()) break; b = nums.top(); nums.pop(); min_sum -= a+b; nums.emplace(a+b); } cout << " " << min_sum; return 0; }
run
|
edit
|
history
|
help
0
多态
Question 1
project euler problem - 3
Addition of two matrix **Part 2
variadic pointer to function template
Chinu
inorder traversal
floyd alfa 2
C++ Inheritance Example
stack