希望更丰富的展现？使用Markdown
by yu__xuan @ 2019-05-10 21:32:15
```cpp
include<bits/stdc++.h>
using namespace std;
int a[1001],b[1001]= {0},c[1001];
double minx=0.0,miny=0.0,s=0.0;
int main() {
int n;
cin>>n;
for(int i=1; i<=n; i++) {
cin>>a[i];
c[i]=i;
}
for(int i=1; i<=n; i++) for(int j=n; j>=1; j--) {
if(a[j]<a[j-1]) {
swap(a[j],a[j-1]);
swap(c[j],c[j-1]);
}
}
for(int i=1; i<=n; i++) {
cout<<c[i]<<" ";
}
for(int i=1; i<=n; i++) {
b[i]=a[i]+b[i-1];
}
for(int i=1; i<=n-1; i++) {
s+=b[i];
}
minx=s;
miny=minx/n;
printf("%.2lf",miny);
return 0;
}
```
救贴
by yu__xuan @ 2019-05-10 21:32:43
@[yu__xuan](/space/show?uid=142110) 好心大佬啊
by DARKSTALKING @ 2019-05-10 21:37:12
少个# 233
by yu__xuan @ 2019-05-10 21:38:45
@[DARKSTALKING](/space/show?uid=121589) 您才是dalao
by yu__xuan @ 2019-05-10 21:39:06
```cpp
#include<bits/stdc++.h>
using namespace std;
int a[1001],b[1001]= {0},c[1001];
double minx=0.0,miny=0.0,s=0.0;
int main() {
int n;
cin>>n;
for(int i=1; i<=n; i++) {
cin>>a[i];
c[i]=i;
}
for(int i=1; i<=n; i++) for(int j=n; j>=1; j--) {
if(a[j]<a[j-1]) {
swap(a[j],a[j-1]);
swap(c[j],c[j-1]);
}
}
for(int i=1; i<=n; i++) {
cout<<c[i]<<" ";
}
for(int i=1; i<=n; i++) {
b[i]=a[i]+b[i-1];
}
for(int i=1; i<=n-1; i++) {
s+=b[i];
}
minx=s;
miny=minx/n;
printf("%.2lf",miny);
return 0;
}
```
by Smile_Cindy @ 2019-05-10 21:40:54