不支持给定路径的格式_C++ 堆中的路径

将一系列给定数字插入一个初始为空的小顶堆H[]。随后对任意给定的下标i，打印从H[i]到根结点的路径。

输入格式:

每组测试第1行包含2个正整数N和M(≤1000)，分别是插入元素的个数、以及需要打印的路径条数。下一行给出区间[-10000, 10000]内的N个要被插入一个初始为空的小顶堆的整数。最后一行给出M个下标。

输出格式:

对输入中给出的每个下标i，在一行中输出从H[i]到根结点的路径上的数据。数字间以1个空格分隔，行末不得有多余空格。

输入样例:

5 3
46 23 26 24 10
5 4 3

输出样例:

24 23 10
46 23 10
26 10

---

思路：构建堆，然后下标不断除以2来输出。有两种建堆方法，题目要求用最笨的那种。。

---

//较为简洁的方法：输入数组后再在树中排序，形成堆
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

class Heap
{
public:
    vector<int> data;
    int size = 0;
    int capacity;    
};
Heap* Create(int n)    //建立一个存储好n个数据的完全二叉树
{
    Heap* heap = new Heap;
    heap->capacity = n;
    heap->data.push_back(-100001);
    int temp;
    for (int i = 0; i < n; i++)
    {
        cin >> temp;
        heap->data.push_back(temp);
    }
    heap->size = n;
    return heap;
}
void SingleBuild(Heap* h, int i)     //单一元素的排序
{
    int temp = h->data[i];
    int parent = i, child = 2 * i;
    for (; child <= h->size; parent = child, child *= 2)
    {
        if (child < h->size && h->data[child + 1] < h->data[child]) child++;
        if (temp < h->data[child])  break;
        else h->data[parent] = h->data[child];
    }
    h->data[parent] = temp;    
}
void Build(Heap* h)      //全部元素的排序
{
    
    for (int i = h->size / 2; i > 0; i--)
        SingleBuild(h, i);    
}
void Output(Heap* h, int i)   //输出
{
    while (i > 1)
    {
        cout << h->data[i] << " ";
        i /= 2;
    }
    cout << h->data[i] << endl;
}

int main()
{
    int n, m, temp;
    cin >> n >> m;
    Heap* h = Create(n);
    Build(h);
    vector<int>num;
    for (int i = 0; i < m; i++)
    {
        cin >> temp;
        num.push_back(temp);
    }
    for (auto ele = num.begin(); ele != num.end(); ele++)    
        Output(h, *ele);
    delete h;
    num.clear();

    return 0;
}

---

//题目要求的办法：插入一个数据就进行排序，时间复杂度更高，但是更基础
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

class Heap
{
public:
    vector<int> data;
    int size = 0;
    int capacity;
    
};
Heap* Create(int n)      //建立空堆
{
    Heap* heap = new Heap;
    heap->capacity = n;
    heap->data.push_back(-10001);
    heap->size = 0;
    return heap;
}

void Output(Heap* h, int i)
{
    while (i > 1)
    {
        cout << h->data[i] << " ";
        i /= 2;
    }
    cout << h->data[i] << endl;
}
void Insert(Heap* h, int n)      //插入单个元素并排序
{
    int i = ++h->size;    
    h->data.resize(h->data.size() + 1);    
    //要用h->data.size()而非sizeof(h->data)，后者为数据类型的大小，与数据数量无关
    for (; n < h->data[i / 2]; i /= 2)            
        h->data[i] = h->data[i / 2];
    h->data[i] = n;  
}

int main()
{
    int n, m, temp;
    cin >> n >> m;
    Heap* h = Create(n);
    for (int i = 0; i < n; i++)
    {
        cin >> temp;
        Insert(h, temp);
    }
    vector<int>num;
    for (int i = 0; i < m; i++)
    {
        cin >> temp;
        num.push_back(temp);
    }
    for (auto ele = num.begin(); ele != num.end(); ele++)    
        Output(h, *ele);
    delete h;
    num.clear();

    return 0;
}