class Solution 
{ 
  public: 
    //Function to find maximum of each subarray of size k. 
    vector <int> max_of_subarrays(int *arr, int n, int k) 
    { 
        // your code here 
        vector<int> temp; 
        vector<int> v; 
        for(int i=0; i<n-k; i++){ 
            temp[0] = arr[i]; 
            temp[1] = arr[i+1]; 
            temp[2] = arr[i+2]; 
            sort(temp.begin(), temp.end()); 
            v.push_back(temp[2]); 
            temp.pop_back(); 
            temp.pop_back(); 
            temp.pop_back(); 
        } 
        return v; 
    } 
};