Insertion or Heap Sort

According to Wikipedia:

Insertion sort iterates, consuming one input element each repetition, and growing a sorted output list. Each iteration, insertion sort removes one element from the input data, finds the location it belongs within the sorted list, and inserts it there. It repeats until no input elements remain.

Heap sort divides its input into a sorted and an unsorted region, and it iteratively shrinks the unsorted region by extracting the largest element and moving that to the sorted region. it involves the use of a heap data structure rather than a linear-time search to find the maximum.

Now given the initial sequence of integers, together with a sequence which is a result of several iterations of some sorting method, can you tell which sorting method we are using?

Input Specification:
Each input file contains one test case. For each case, the first line gives a positive integer N (≤100). Then in the next line, N integers are given as the initial sequence. The last line contains the partially sorted sequence of the N numbers. It is assumed that the target sequence is always ascending. All the numbers in a line are separated by a space.

Output Specification:
For each test case, print in the first line either “Insertion Sort” or “Heap Sort” to indicate the method used to obtain the partial result. Then run this method for one more iteration and output in the second line the resulting sequence. It is guaranteed that the answer is unique for each test case. All the numbers in a line must be separated by a space, and there must be no extra space at the end of the line.

Sample Input 1:

10
3 1 2 8 7 5 9 4 6 0
1 2 3 7 8 5 9 4 6 0
1
2
3

Sample Output 1:

Insertion Sort
1 2 3 5 7 8 9 4 6 0
1
2

Sample Input 2:

10
3 1 2 8 7 5 9 4 6 0
6 4 5 1 0 3 2 7 8 9
1
2
3

Sample Output 2:

Heap Sort
5 4 3 1 0 2 6 7 8 9
1
2

题目大意：
给你长度为n的两个序列，判断第二个序列是第一个序列经过插入排序还是堆排序之后的结果，然后输出是哪种排序，在输出第二个序列下一趟的排序序列。

#include
using namespace std;
const int maxn = 150;
int insert[maxn], heap[maxn], a[maxn], b[maxn], n;
bool judge(int a[], int b[]) {
    for(int i = 1; i <= n; i++) {
        if(a[i] != b[i]) return false;
    }
    return true;
}
void print(int a[]) {
    printf("%d", a[1]);
    for(int i = 2; i <= n; i++) printf(" %d", a[i]);
}
bool insertsort(int a[]) {
    for(int i = 2; i <= n; i++) {
        if(a[i-1] > a[i]) {
            int temp = a[i], j;
            for(j = i-1; temp < a[j]; j--) a[j+1] = a[j];
            a[j+1] = temp;
        }
        if(judge(a, b)) {
            puts("Insertion Sort");
            i++;
            if(a[i-1] > a[i]) {
                int temp = a[i], j;
                for(j = i-1; temp < a[j]; j--) a[j+1] = a[j];
                a[j+1] = temp;
            }
            print(a);
            return true;
        }
    }
    return false;
}
void HeapAdjust(int a[], int k, int len) {
    a[0] = a[k];
    for(int i = k * 2; i <= len; i *= 2) {
        if(i < len && a[i] < a[i + 1]) i++;
        if(a[0] > a[i]) break;
        else {
            a[k] = a[i];
            k = i;
        }
    }
    a[k] = a[0];
}
void BuildMaxHeap(int a[]) {
    for(int i = n / 2; i > 0; i--) 
        HeapAdjust(a, i, n);
}
void heapsort(int a[]) {
    BuildMaxHeap(a);
    for(int i = n; i > 1; i--) {
        swap(a[1], a[i]);
        HeapAdjust(a, 1, i - 1);
        if(judge(a, b)) {
            puts("Heap Sort");
            swap(a[1], a[--i]);
            HeapAdjust(a, 1, i-1);
            print(a);
        }
    }
}
int main() {
    scanf("%d", &n);
    for(int i = 1; i <= n; i++) {
        scanf("%d", &a[i]);
        insert[i] = heap[i] = a[i];
    }
    for(int i = 1; i <= n; i++) scanf("%d", &b[i]);
    if(insertsort(insert)) return 0;
    heapsort(heap);
    return 0;
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75