WA80错8和10

#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
struct node
{
    int index;
    int t;
}a[1000];
bool cmp(node a, node b)
{
    return a.t < b.t;
}
int main(void)
{
    int n;
    scanf("%d", &n);
    for (int i = 0; i < n; i++)
    {
        a[i].index = i + 1;
        scanf("%d", &a[i].t);
    }
    sort(a, a + n, cmp);
    int tot = 0, ans = 0;
    for (int i = 0; i < n; i++)
    {
        printf("%d ", a[i].index);
        ans += tot;
        tot += a[i].t;
    }
    double result = (double)ans / n;
    printf("\n%0.2lf", result);
    return 0;
}
[/codec]