HDU-4968 Improving the GPA 暴力枚举

每科成绩只有5种情况，最多10门，枚举每种情况里有几门，暴力做的，31ms，不知道是不是数据很小。

#include <iostream>
#include <cmath>
#include <queue>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <cstdlib>
using namespace std;
int n;
int avg;
int main()
{
	int t;
	double minv,maxv;
	int mins,maxs;
	double sum;
	scanf("%d",&t);
	while(t--)
	{
		scanf("%d%d",&avg,&n);
		minv=100;
		maxv=0;
		for(int i=0;i<=n;i++)
		{
			for(int ii=0;ii<=n;ii++)
			{
				for(int iii=0;iii<=n;iii++)
				{
					for(int iiii=0;iiii<=n;iiii++)
					{
						for(int j=0;j<=n;j++)
						{
							if(i+ii+iii+iiii+j==n)
							{
								mins=60*i+70*ii+75*iii+80*iiii+85*j;
								maxs=69*i+74*ii+79*iii+84*iiii+100*j;
								sum=2.0*i+2.5*ii+3.0*iii+3.5*iiii+4.0*j;
								sum/=(double)n;
								if(mins<=avg*n&&avg*n<=maxs)
								{
									minv=min(minv,sum);
									maxv=max(maxv,sum);
								}
							}
						}
					}
				}
			}
		}
		printf("%.4f %.4f\n",minv,maxv);
	}
	return 0;
}