Monk and Rotation [Hacker earth]

PROBLEM:

Monk loves to preform different operations on arrays, and so being the principal of Hackerearth School, he assigned a task to his new student Mishki. Mishki will be provided with an integer array $A$ of size $N$ and an integer $K$ , where she needs to rotate the array in the right direction by K steps and then print the resultant array. As she is new to the school, please help her to complete the task.

Input:
The first line will consists of one integer $T$ denoting the number of test cases.
For each test case:
1) The first line consists of two integers $N$ and $K$, $N$ being the number of elements in the array and $K$ denotes the number of steps of rotation.
2) The next line consists of $N$ space separated integers , denoting the elements of the array $A$.

Output:
Print the required array.

SOLUTION:

#include<iostream>
using namespace std;
int main()
{    int t;    
     cin>>t;
     while(t--)    
     {        
          int n,k,p;        
          cin>>n;        
          int a[n];
          cin>>k;
          for(int i=0;i<n;i++)
          {
              cin>>a[i];        
          }        
          k%=n;
          for(int i=0;i<n;i++)
          {
               p = a[(i+(n-k))%n];
               cout<<p<<" ";
          } cout<<"\n";
      }
return 0;
}

OUTPUT:

IMAGES CREDIT: Hacker earth