AcWing 3537. Tree lookup complete binary tree

Title Description

https://www.acwing.com/problem/content/3540/
Output the... Of the complete binary tree stored in the array $k$ All values of the row

---

Code

#include<iostream>
#include<cmath>
using namespace std;
const int N=1010;
int tree[N];
int n;
int k;
int main()
{
    
    scanf("%d",&n);
    for(int i=1;i<=n;i++) scanf("%d",&tree[i]);
    
    scanf("%d",&k);
    
    if((1<<(k-1))>n)       // If the given number of rows K＞ Maximum number of rows , Then the output must be empty 
    {
    
        printf("EMPTY");
        return 0;
    }                     // The maximum value is exquisite 
    for(int i=(1<<(k-1));i<min(n+1,(1<<k));i++)  // Output the line 
        printf("%d ",tree[i]);
    return 0;
}

---