[C++] 백준11399: ATM

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

void bubble_sort(vector<int>& waiting_time_list) {
	int temp;

	for (int i = 0; i < waiting_time_list.size() - 1; i++) {
		for (int j = i + 1; j < waiting_time_list.size(); j++) {
			if (waiting_time_list[i] > waiting_time_list[j]) {
				swap(waiting_time_list[i], waiting_time_list[j]);
			}
		}
	}
}

int main() {
	vector<int> waiting_time_list;
	int count, waiting_time, sum = 0;
	cin >> count;

	if (count < 1 || count > 1000) return false;

	for (int i = 0; i < count; i++) {
		cin >> waiting_time;
		if (waiting_time < 1 || waiting_time > 1000) return false;
		waiting_time_list.push_back(waiting_time);
	}

	bubble_sort(waiting_time_list);

	for (int i = 0; i < waiting_time_list.size(); i++) {
		sum += waiting_time_list[i] * (waiting_time_list.size() - i);
	}

	cout << sum;
}