c++ coding for data structure

Write a class (or a set of functions, if you are using C) that implements a 7-Heap (i.e., each node has up to 7 children) using an array as discussed in class. You can choose whether the root of the heap is stored in position 0 or 1 of the array as you see fit. Each node of the heap contains two elements: a priority level (integer), and a string value. Implement insert(priority, string_value) that inserts an element in the heap, and delete_max() that removes the value with the highest priority and returns the corresponding string value. (Do not implement delete_min. Optimize the heap structure for delete_max.)