全WE
  • 板块P1223 排队接水
  • 楼主wo488
  • 当前回复3
  • 已保存回复3
  • 发布时间2024/10/14 17:48
  • 上次更新2024/10/14 20:22:03
查看原帖
全WE
1198506
wo488楼主2024/10/14 17:48
#define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
#include<algorithm>
#define N 10001

using namespace std;
typedef struct order {
	int data;
	int index;
};
struct order ss[N];
bool cmp(order a, order b) {
	return a.data < b.data;
}
int main(){
	int n;
	int i,j;
	int total; double sum;
	cin >> n;
	for (i = 1; i <= n; i++) {
		scanf("%d",&ss[i].data);
		ss[i].index = i;

		
	}
	sort(ss+1,ss+n+1, cmp);
	sum = 0.0;
	for (i = 1; i < n; i++) {
		total = 0;
		for (j = 1; j <= i; j++) {
			total += ss[j].data;

		}
		sum += total;
	}
	for (i = 1; i <= n; i++) {
		printf("%d  ", ss[i].index);
	}
	printf("\n");
	sum = (double)sum / (n);
	printf("%.2lf",sum);
	


}

2024/10/14 17:48
加载中...