benchmarks/Data_structures/priority_queue_decrease_key/problem.md

# Priority Queue with Decrease-Key

## Problem Description

Maintain an indexed minimum heap supporting insertion, deletion, and decrease-key updates.

## Input

The functions receive the array representation, its logical size or capacity, and the operation-specific values described by their C signatures.

## Output

Each operation returns or updates the represented data structure according to its interface contract.

## Constraints

All indices, sizes, capacities, and stored values satisfy the bounds stated by the corresponding function contract.

## Source

Classical data-structure implementation reconstructed from the verified C artifact.