class Solution {

 public:

     #define inf 0x3f3f3f3f

     int tallestBillboard(vector<int>& rods) {

         int f[][];

         memset(f,-inf,sizeof(f));

         f[][]=;

         for(int i=;i<rods.size();++i){

             for(int j=;j<=;++j){

                 f[i+][j]=max(f[i+][j],f[i][j]);

                 if(j>=rods[i]&&f[i][j-rods[i]]!=-inf)f[i+][j]=max(f[i+][j],rods[i]+f[i][j-rods[i]]);

                 if(rods[i]>=j&&f[i][rods[i]-j]!=-inf)f[i+][j]=max(f[i+][j],j+f[i][rods[i]-j]);

                 if(j+rods[i]<=&&f[i][j+rods[i]])f[i+][j]=max(f[i+][j],f[i][j+rods[i]]);

             }

         }

         return max(,f[rods.size()][]);

     }

 };