株洲今日头条新闻事件_重庆响应式网站平台_手机优化大师哪个好_免费软文推广平台都有哪些

#include<iostream>
#include<algorithm>
using namespace std;
int n[1010], t[1010];
int main() {int N;cin >> N;for (int i = 1; i <= N; i++) {n[i] = i;cin >> t[i];}for (int i = 1; i <= N; i++) {for (int j = 1; j <= N - i; j++) {if (t[j] > t[j + 1]) {swap(t[j], t[j + 1]);swap(n[j], n[j + 1]);}}}for (int i = 1; i <= N; i++) cout << n[i] << " ";cout << endl;double x = 0;double e = 0;for (int i = 1; i <= N; i++) {e += t[i];x += e;}x -= e;printf("%.2lf", x / N);return 0;
}