Sum up vector and insert function

[yat89]

Hi everyone, I got a task to sum up vectors. But each time the amount of the summation reaches 15, I need to insert the value of 0 and sum up the next number until it end of vector.

For example:

Original vector:
5 3 2 4 6 7 1 6 5 3 8 6 1 9 3
Here, total sum of (5 + 3 + 2 + 4) <= 15. Then, I need to insert 0 after 4

The new vector should be:
5 3 2 4 0 6 7 1 6 5 3 8 6 1 9 3
Total sum (6 + 7 + 1) <= 15. Then, I need to insert 0 after 1

The new vector should be:
5 3 2 4 0 6 7 1 0 6 5 3 8 6 1 9 3
Total sum (6 + 5 + 3) <= 15. Then, I need to insert 0 after 3

The new vector should be:
5 3 2 4 0 6 7 1 0 6 5 3 0 8 6 1 9 3
Total sum (8 + 6 + 1) <= 15. Then, I need to insert 0 after 1.

The new vector should be:
5 3 2 4 0 6 7 1 0 6 5 3 0 8 6 1 0 9 3
Total sum (9 + 3) <= 15. Then, I need to insert 0 after 3.

The final vector should be:
5 3 2 4 0 6 7 1 0 6 5 3 0 8 6 1 0 9 3 0

In the code below. I had sum up all the vector using partial sum function. Then each time it reach 15, I will insert 0. I would like to ask is there any other option I could do to get the answer as above. In which each time total sum less than or equal to 15. Zero will be insert automatically.

Any advice is appreciated.

#include <iostream> 
#include <vector> 
#include <numeric>   
#include <algorithm>

using namespace std; 

const int col = 15;

int main () 
{ 
    
    int myints [] = { 5, 3, 2, 4, 6, 7, 1, 6, 5, 3, 8, 6, 1, 9, 3 };
    vector<int> vec (myints, myints + sizeof(myints) / sizeof(int) );
      
    // Print Original Vector 
    cout << "Original vector :"; 
    for (int i = 0; i < col; i++) 
	{
        cout << " " << vec[i];
	}   
    cout << endl; 

	// Compute the partial sum
	// Reserve space for the partial sums
	vector<int> partialSum (col);
	
	for(int i = 0; i < col; i++)
	{
		partial_sum(vec.begin(), vec.end(), partialSum.begin());
	}

	// Display the solution of partial sum
	cout << "Partial sum vector :"; 
	for(int i = 0; i < col; i++)
	{
		cout << " " << partialSum[i];
	}
	cout << endl;

	int Q = 15;

	// Iterator used to store the position of searched element 
	vector<int>::iterator upper; 
    
	// upper_bound function 
	upper = upper_bound (partialSum.begin(), partialSum.end(), Q); 

	int i1 = (upper - partialSum.begin());

	cout << "Position " << i1 << " were chosen.\n";

	vec.insert(vec.begin() + i1, 0);

	// Display the solution 
	cout << "Vector after insert new element :"; 
	for(int i = 0; i < vec.size(); i++)
	{
		cout << " " << vec[i];
	}
	cout << endl;

    system("pause");
    return 0; 
} 

[E0p9LyTq]

Quick and dirty:

#include <iostream>
#include <vector>

int main()
{
   const int col = 15;

   std::vector<int> vec = { 5, 3, 2, 4, 6, 7, 1, 6, 5, 3, 8, 6, 1, 9, 3 };

   std::cout << "Original vector:\n";

   for (const auto& itr : vec)
   {
      std::cout << itr << ' ';
   }
   std::cout << '\n';

   int sum = 0;

   for (auto itr = vec.begin(); itr != vec.end(); itr++)
   {
      if (sum + *itr > col)
      {
         // inserting an element invalidates the iterator, get a new one
         itr = vec.insert(itr, 0);

         sum = 0;
      }
      sum += *itr;
   }

   // add on a final zero to end out the series
   vec.push_back(0);

   std::cout << "New vector:\n";

   for (const auto& itr : vec)
   {
      std::cout << itr << ' ';
   }
   std::cout << '\n';
}

Original vector:
5 3 2 4 6 7 1 6 5 3 8 6 1 9 3
New vector:
5 3 2 4 0 6 7 1 0 6 5 3 0 8 6 1 0 9 3 0

[E0p9LyTq]

If you want to get really fancy, setting up an overloaded operator<< so you can easily print a vector:

#include <iostream>
#include <vector>

template <typename T>
std::ostream& operator<<(std::ostream& os, const std::vector<T>& v)
{
   for (auto const& x : v)
   {
      std::cout << x << ' ';
   }

   return os;
}

int main()
{
   const int col = 15;

   std::vector<int> vec = { 5, 3, 2, 4, 6, 7, 1, 6, 5, 3, 8, 6, 1, 9, 3 };

   std::cout << "Original vector:\n" << vec << '\n';

   int sum = 0;

   for (auto itr = vec.begin(); itr != vec.end(); itr++)
   {
      if (sum + *itr > col)
      {
         itr = vec.insert(itr, 0);

         sum = 0;

         std::cout << "\nPartial vector:\n" << vec << '\n';
      }
      sum += *itr;
   }

   vec.push_back(0);

   std::cout << "\nNew vector:\n" << vec << '\n';
}

Original vector:
5 3 2 4 6 7 1 6 5 3 8 6 1 9 3

Partial vector:
5 3 2 4 0 6 7 1 6 5 3 8 6 1 9 3

Partial vector:
5 3 2 4 0 6 7 1 0 6 5 3 8 6 1 9 3

Partial vector:
5 3 2 4 0 6 7 1 0 6 5 3 0 8 6 1 9 3

Partial vector:
5 3 2 4 0 6 7 1 0 6 5 3 0 8 6 1 0 9 3

New vector:
5 3 2 4 0 6 7 1 0 6 5 3 0 8 6 1 0 9 3 0

[lastchance]

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

//==========================================================

vector<int> infill( const vector<int> &V, int limit )
{
   vector<int> W;
   if ( limit < *max_element( V.begin(), V.end() ) )
   {
      cout << "Can't be done. Hard luck.\n";
      return W;
   }

   int sum = 0;
   for ( auto e : V )
   {
      sum += e;
      if ( sum > limit )
      {
         W.push_back( 0 );
         sum = e;
      }
      W.push_back( e );
   }
   W.push_back( 0 );

   return W;
}

//==========================================================

template<typename T> ostream& operator << ( ostream &str, const vector<T> &V )
{
   for ( T e : V ) cout << e << ' ';
   return str;
}

//==========================================================

int main()
{
   vector<int> A = { 5, 3, 2, 4, 6, 7, 1, 6, 5, 3, 8, 6, 1, 9, 3 };
   cout << "Original vector: " << A << '\n';
   cout << "Infilled vector: " << infill( A, 15 ) << '\n';
}

Original vector: 5 3 2 4 6 7 1 6 5 3 8 6 1 9 3 
Infilled vector: 5 3 2 4 0 6 7 1 0 6 5 3 0 8 6 1 0 9 3 0 

[yat89]

Thanks FurryGuy and lastchance for your suggestions.
Most appreciated.