diaosipan 2014-03-10 03:30:25
点我顶贴
收藏
删除
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdlib>
#include<utility>
#include<cstdio>
#include<vector>
#include<string>
#include<cmath>
#include<ctime>
#include<deque>
#include<queue>
#include<stack>
#include<map>
#include<set>
using namespace std;
int n,m,a[10001],i,j,tot,c[10001];
double ans;
int main()
{
cin>>n;
for(i=1;i<=n;i++){
scanf("%d",&a[i]);
c[i]=i;}
for(i=1;i<=n-1;i++)
for(j=i+1;j<=n;j++)
if (a[i]>a[j]||(a[i]==a[j]&&c[i]>c[j])){int t=a[i];a[i]=a[j];a[j]=t; t=c[i];c[i]=c[j];c[j]=t;}
for(i=1;i<=n-1;i++)
cout<<c[i]<<" ";
cout<<c[n]<<endl;
for(i=1;i<=n-1;i++)
{
tot+=a[i];
ans+=tot;
}
printf("%.2lf\n",ans/n);
}