3321087_ac_141ms_208k.cpp

北大大牛代码 1240道题的原代码 超级权威

#include <stdio.h>
#include <algorithm>

using namespace std;

int m, n;
double height[1000];

int main()
{
	int i, j, region = 1;
	double h, v, cnt, tot, level;

	while(scanf("%d%d",&m,&n)==2)
	{
		if(m==0&&n==0)
		{
			break;
		}
		m = m*n;
		for(i = 0; i < m; i++)
		{
			scanf("%lf",&height[i]);
		}
		scanf("%lf",&tot);
		sort(height,height+m);
		cnt = 0;
		for(i = 0; i < m; i++)
		{
			j = i;
			while(j < m&&height[j]==height[i])
			{
				j++;
				cnt += 100;
			}
			if(j!=m)
			{
				h = height[j]-height[i];
				v = h*cnt;
				if(tot - v > 0)
				{
					tot -= v;
				}
				else
				{
					level = tot / cnt + height[i];
					break;
				}
			}
			else
			{
				level = height[i] + tot / cnt;
				break;
			}
			i = j-1;
		}
		printf("Region %d\n",region++);
		printf("Water level is %.2lf meters.\n",level);
		printf("%.2lf percent of the region is under water.\n",cnt/(1.0*m));
	}
	return 0;
}