用线性时间复杂度的算法将给定序列{ 28, 12, 5, 8, 19, 20, 15, 22 }调整为最大堆（大根堆），然后插入30。则结果序列为：

A、{ 5, 8, 28, 12, 19, 20, 15, 22, 30 };

B、{ 30, 28, 20, 22, 12, 5, 15, 8, 19 };

C、{ 30, 28, 22, 20, 19, 15, 12, 8, 5 };

D、{ 30, 28, 20, 22, 19, 5, 15, 8, 12 }