long sumTwoSmallestNumbers(std::vector<int> numbers)
{
 int x, z;
 int y=0;
 int n;

  int i, j;
  int t;
  n = sizeof(numbers) / sizeof(int);
  std::cout<< n;

    for( i = 0; i < n; i++ )
      {
        for( j = n - 1; j > i; j-- )
          {
            if( numbers[j] < numbers[j - 1] )
              {
                t = numbers[j];
                numbers[j] = numbers[j - 1];
                numbers[j - 1] = t;
              }
          }
      }

  if (numbers[0] > 0)
    {
      x=numbers[0]+numbers[1];
    }
   /* else
      {
         while (numbers[y] <0)
          {
             y=y+1;
          }

          z=y+1;
          x=numbers[y]+numbers[z];
       }
   */
    return x;

}