ATM

#include <cstdio> #include <algorithm> using namespace std; void selecting_sort(int arr[], int n) { int result = 0; for(int i = 0 ; i < n - 1 ; i++) { for (int j = i + 1 ; j < n ; j++) { if(arr[i] > arr[j]) swap(arr[i], arr[j]); } } for (int i = 1; i < n; i++) arr[i] += arr[i - 1]; for (int i = 0; i < n; i++) result += arr[i]; printf("%d", result); } int main() { int n; scanf("%d", &n); int atm[n]; for (int i = 0; i < n; i++) scanf("%d", &atm[i]); selecting_sort(atm, n); return 0; }

#include <cstdio> using namespace std; int N_Arr[1000] = {0,}; void Counting_Sort(int n, int atm[], int maxval) { int arr[maxval + 1] = {0,}; for (int i = 0; i < n; i++) arr[atm[i]]++; for (int i = 1; i <= maxval; i++) arr[i] = arr[i] + arr[i - 1]; for (int i = 0; i < n; i++) { arr[atm[i]]--; N_Arr[arr[atm[i]]] = atm[i]; } } int main() { int n; scanf("%d", &n); int atm[n]; int result = 0; int max = 0; for (int i = 0; i < n; i++) scanf("%d", &atm[i]); for (int i = 0; i < n; i++) { if (atm[i] > max) max = atm[i]; } Counting_Sort(n, atm, max); for (int i = 1; i < n; i++) { N_Arr[i] += N_Arr[i - 1]; } for (int i = 0; i < n; i++) result += N_Arr[i]; printf("%d", result); return 0; }

n = int(input()) a = list(map(int, input().split())) result = 0 a.sort() for i in range(1,n): a[i] += a[i - 1] for i in range(n): result += a[i] print(result)