冒泡排序案例

#include <iostream>
using namespace std;

int main() {
	int n, temp;
	cin >> n;
	int a[10000];
	int sum = 0;
	for (int i = 0; i < n; i++) {
		cin >> a[i];
		sum += a[i];
	}
	for (int i = 0; i < n - 1; i++) {
		for (int j = 0; j < n - i - 1; j++) {
			if (a[j] > a[j + 1]) {
				temp = a[j];
				a[j] = a[j + 1];
				a[j + 1] = temp;
			}

		}
	}
	cout << a[n - 1] << endl;
	cout << a[0] << endl;
	cout << sum << endl;
	return 0;
}