#include <iostream>#include <stdio.h>#include <memory.h>#include <algorithm>using namespace std;#define eps 1e-8int n;double f[110][110],w[110][110],d[110];int main(){ int i,j,k,tem; while(scanf("%d",&n)!=EOF) { d[0]=0.0; for(i=1;i<=n;i++) { scanf("%lf",&d[i]); } sort(d+1,d+n+1); for(i=1;i<=n;i++){ w[i][i]=100.0; for(j=i+1;j<=n;j++) { tem=i+(j-i+1)/2; w[i][j]=0.0; for(k=i;k<=tem;k++) w[i][j]+=d[tem]-d[k]; for(;k<=j;k++) w[i][j]+=d[k]-d[tem]; w[i][j]=(j-i+1)*100.0-w[i][j]; } } for(i=0;i<=n;i++) { for(j=0;j<=n;j++) f[i][j]=-1.0; } f[0][0]=0.0; f[1][1]=100.0; for(i=2;i<=n;i++) { for(j=1;j<=i;j++) { for(k=i-1;k>=j-1&&d[i]+eps<=25.0+d[k+1];k--) { if(f[k][j-1]+eps<0.0) continue; tem=i-k; if(f[k][j-1]+w[k+1][i]>f[i][j]+eps) f[i][j]=f[k][j-1]+w[k+1][i]; } } } for(j=1;j<=n;j++) { if(f[n][j]>=0) break; } printf("%d %.2lfn",j,f[n][j]); } return 0;}
