poj 2709 贪心 painter

#include <iostream>#include <stdio.h>#include <algorithm>using namespace std;int main(){    int n;    int gray,color[1001];    while(scanf("%d",&n)!=EOF)    {      if(n==0) break;      for(int i=0;i<n;i++)         scanf("%d",&color[i]);       scanf("%d",&gray);       sort(color,color+n);       while(gray--)       {           color[0]++;           color[1]++;           color[2]++;           sort(color,color+n);        }        sort(color,color+n);        int max=color[n-1];        int ans=(max%50==0)? (max/50):(max/50+1);        printf("%d\n",ans);        }    return 0;}