In this HackerRank Variable Size Arrays problem in c++, we have given a, you must answer q queries. Each query is in the format i j, where i denotes an index in array a and j denotes an index in the array located at a[i]. For each query, find and print the value of element j in the array at a location a[i] on a new line.

## HackerRank Variable Sized Arrays in C++ problem solution

```#include <iostream>

using namespace std;

int main(int argc, char *argv[]) {
int n;
int q;
cin >> n >> q;

// Create an array of pointers to integer arrays
// (i.e., an array of variable-length arrays)
int** outer = new int*[n];

// Fill each index of 'outer' with a variable-length array
for(int i = 0; i < n; i++) {
int k;
cin >> k;
// Create an array of length 'k' at index 'i'
outer[i] = new int[k];

// Fill each cell in the 'inner' variable-length array
for(int j = 0; j < k; j++) {
cin >> outer[i][j];
}
}

// Perform queries:
while(q-- > 0) {
int outer_index;
int inner_index;
cin >> outer_index >> inner_index;

// Find the variable-length array located at outer_index
// and print the value of the element at inner_index.
cout << outer[outer_index][inner_index] << endl;
}

return 0;
}
```