Given two sorted arrays, return single sorted array

sortDiffSizeArrays.cpp

#include <iostream>
#include <vector>

using namespace std;
int main(int argc, char *argv[]) {
	vector <int> A = {10,20,30,40,50,60,70,80};
	
	int i = A.size()-1;
	
	vector <int> B = {11,22,33,44};
	
	A.resize(A.size()+B.size());
	
	int k = A.size() -1;
	
	int j=B.size()-1;
	
	while (i >=0  && j >= 0) {
	     if (A[i] > B[j]) {
			 A[k] = A[i];
			 k--; i--;
		 } else {
			A[k] = B[j]; 
			k--; j--;
		 }
	}
	
	while (j >= 0) {
		A[k--] = B[j--];
	}
	
	for (int i=0; i<A.size();i++) {
		cout << A[i] << " ";
	}
	
	return 0;
}