PTA 09-排序3 Insertion or Heap Sort （25 分）

#include <bits/stdc++.h>
using namespace std;
int main()
{
	#ifdef ONLINE_JUDGE
	#else 
	freopen("in.txt", "r", stdin);
	#endif
	
	int N; 
	cin >> N;
	int A[N], B[N];
	int i, j;
	int cnt;
	for(i = 0; i < N; i++){
		cin >> A[i];
	}
	for(j = 0; j < N; j++){
		cin >> B[j];
	}
	
	for(i = 1; B[i] >= B[i-1]; i++);
	cnt = i;
	while(cnt < N && A[cnt] == B[cnt]){
		cnt++;
	}
	
	if(cnt == N){
		cout << "Insertion Sort" << endl;
		
		sort(B, B+i+1);
		
		cout << B[0];
		for(i = 1; i < N; i++){
			cout << " " << B[i];
		}
	}else{
		cout << "Heap Sort" << endl;
		
		sort(A, A+N);
		for(i = N-1; i>0 && B[i] == A[i]; i--);
		pop_heap(B, B+i+1);
		
		cout << B[0];
		for(i = 1; i < N; i++){
			cout << " " << B[i]; 
		}
	} 
	
	
}