#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<iomanip>
struct node
{int b,num;}a[1200],k;
using namespace std;
int main()
{
int n,i,j,l=0;
float ans=0;
bool bomb;
cin>>n;
for(i=1;i<=n;i++){cin>>a[i].b;a[i].num=i;}
for(i=n-1;i>=1;i--)
for(j=1;j<=i;j++)
{
if(a[j].b>a[j+1].b)
{k=a[j];
a[j]=a[j+1];
a[j+1]=k;
}
}
for(i=1;i<=n;i++)
cout<<a[i].num<<' ';
cout<<endl;
for( i=1;i<=n;i++)
{
ans+=a[i].b*(n-i);
}
ans/=n;
printf("%.2lf",ans);
cout<<endl;
return 0;}
by 你奈我何呵呵 @ 2018-09-20 21:09:07
```
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<iomanip>
struct node {int b,num;}a[1200],k; using namespace std; int main() { int n,i,j,l=0; float ans=0; bool bomb; cin>>n; for(i=1;i<=n;i++){cin>>a[i].b;a[i].num=i;} for(i=n-1;i>=1;i--) for(j=1;j<=i;j++) { if(a[j].b>a[j+1].b) {k=a[j]; a[j]=a[j+1]; a[j+1]=k; } }
for(i=1;i<=n;i++) cout<<a[i].num<<' '; cout<<endl; for( i=1;i<=n;i++) { ans+=a[i].b*(n-i); } ans/=n; printf("%.2lf",ans); cout<<endl; return 0;}
```
by wwz20050323 @ 2018-09-20 21:09:46
```
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<iomanip>
struct node
{int b,num;}
a[1200],k;
using namespace std;
int main()
{
int n,i,j,l=0;
float ans=0;
bool bomb;
cin>>n;
for(i=1;i<=n;i++)
{cin>>a[i].b;
a[i].num=i;}
for(i=n-1;i>=1;i--)
for(j=1;j<=i;j++)
{ if(a[j].b>a[j+1].b)
{k=a[j]; a[j]=a[j+1]; a[j+1]=k; } }
for(i=1;i<=n;i++)
cout<<a[i].num<<' ';
cout<<endl;
for( i=1;i<=n;i++)
{ ans+=a[i].b*(n-i); }
ans/=n;
printf("%.2lf",ans);
cout<<endl;
return 0;
}
要整齐，不然没人想看~
```
by wwz20050323 @ 2018-09-20 21:11:19
```
#include<stdio.h>
int a[1001],e[1001];
void q(int a[],int b,int c)
{
int i=b,j=c,t;
int p=a[(b+c)/2];
while(i<=j)
{while(a[i]<p)
{i++;}
while(a[j]>p)
{j--;}
if(i<=j)
{t=a[i];
a[i]=a[j];
a[j]=t;
t=e[i];
e[i]=e[j];
e[j]=t;
i++;
j--;}}
if(b<j)
{q(a,b,j);}
if(i<c)
{q(a,i,c);}
}
int main()
{
int d,i,j;
double s=0;
scanf("%d",&d);
for(i=1;i<=d;i++)
{scanf("%d",&a[i]);
e[i]=i;}
q(a,1,d);
for(i=1;i<=d;i++)
printf("%d ",e[i]);
printf("\n");
for(j=1;j<=d;j++)
for(i=1;i<j;i++)
s+=a[i];
printf("%.2lf",s/d);
return 0;
}
```
by 不到前10不改名 @ 2018-09-20 21:13:58
@[你奈我何呵呵](/space/show?uid=49519)
by 不到前10不改名 @ 2018-09-20 21:14:03