A1147

本题还比A1098容易，都无需进行堆排序，一遍AC.

#include<cstdio>
#include<cstdlib>
#include<string.h>
#include<math.h>
#include<iostream>
#include<vector>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<string>
#include<algorithm>
using namespace std;
const int maxn=1010;
int m,n,ori[maxn];
bool judge_max(){
	for(int i=1;i<=n/2;i++){
		int left=i*2,right=i*2+1;
		if(ori[left]>ori[i]||(right<=n&&ori[right]>ori[i])){
			return false;
		}
	}
	return true;
}
bool judge_min(){
	for(int i=1;i<=n/2;i++){
		int left=i*2,right=i*2+1;
		if(ori[left]<ori[i]||(right<=n&&ori[right]<ori[i])){
			return false;
		}
	}
	return true;
}
void postorder(int root){
	if(root>n){
		return;
	}
	postorder(root*2);
	postorder(root*2+1);
	printf("%d",ori[root]);
	if(root!=1){
		printf(" ");
	}else{
		printf("\n");
	}
}
int main(){
	#ifdef ONLINE_JUDGE
	#else
		freopen("1.txt","r",stdin);
	#endif
	scanf("%d %d",&m,&n);
	for(int i=0;i<m;i++){
		for(int j=1;j<=n;j++){
			scanf("%d",&ori[j]);
		}
		if(judge_max()){
			printf("Max Heap\n");
		}else{
			if(judge_min()){
				printf("Min Heap\n");
			}else{
				printf("Not Heap\n");
			}
		}
		postorder(1);
	}
	return 0;
}