题目809-摸底-nyoj20140818

#include <stdio.h>
int main()
{
    int n;
    scanf("%d",&n);
    while(n--)
    {
        int a[10],i,j,t,m;
        for(i=0;i<7;i++)
        scanf("%d",&a[i]);
        for(i=0;i<7-1;i++)
        for(j=0;j<7-i-1;j++)
        {
            if(a[j]>a[j+1])
            {
                t=a[j];
                a[j]=a[j+1];
                a[j+1]=t;
                }
            }
            m=a[0]+a[3]+a[6];
            printf("%.2f\n",m/3.0); 
        }
        return 0;
    }

题目809-摸底-nyoj20140818,布布扣,bubuko.com

题目809-摸底-nyoj20140818

原文：http://www.cnblogs.com/xiaziteng/p/3920010.html