Tape Equilibrium

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

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
using namespace std;
int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)

    //i,j,k
     int i = 0;
     int j = 1;
     vector<int>b;
     int sum1,sum2=0;
     int k = A.size();
    //sum from i to j, sum for j to k
       while(j!=k)
       {
           if(i==0 && j==1)
           {
            sum1 = A[0];
            sum2 = accumulate(A.begin()+(j), A.begin()+k,0);

           }
           else{
           sum1 = accumulate(A.begin()+i, A.begin()+j,0);
           sum2 = accumulate(A.begin()+(j), A.begin()+k,0);
           }
           
           int a = abs(sum1-sum2);
           b.push_back(a);
           j++;
                    

       }
     
    //store diff in vector and ret min element
    return *min_element(b.begin(),b.end());
}