洪水！（Flooded! ACM/ICPC World Final 1999,UVa815)

题目描述：竞赛入门经典的习题4-10

解题思路：1.把各个网格想象成一个数组

　　　　　2.排序

　　　　　3.雨水总体积去铺满

//太懒了只写了求海拔

#include <stdio.h>
#define maxn 50
int altitude[maxn*maxn] ;int smr[maxn][maxn] ;
int main(int argc, char *argv[])
{
    int n,m,i ;
    while(scanf("%d%d",&n,&m) == 2 &n &m){
        //循环输入 
        for(i=0;i<n*m;i++) scanf("%d",&altitude[i]) ;
        int water,count = i ; //网格数量
        scanf("%d",&water) ;
        //排序
         for(int i=0;i<n*m-1;i++)
             for(int j=0;j<n*m-1-i;j++)
                 if(altitude[j]>altitude[j+1]){
                     int t = altitude[j] ;
                     altitude[j] = altitude[j+1] ;
                     altitude[j+1] = t ;
                 } 
        //for(int i=0;i<n*m;i++) printf("%d     ",altitude[i]) ;
        printf("
") ;
        int i,lw ,flag=0,t=0;
    
        for(i=0;i<count-1;i++){
            if(altitude[i+1]>altitude[i]){
                t = (i+1)*(altitude[i+1] - altitude[i])*10*10 + t ;
                if(t<=water) lw = t ;
                else{
                    flag = 1;
                    break ;
                }        
            }
            if(flag) break ;
            //printf("%d  ",lw);
        } 
        //printf("
%d",i) ;
        //printf("
%d",altitude[i]) ;
        printf("
%f",altitude[i]+(float)(water - lw)/((i+1)*100)) ;
    }    
    return 0;
}