{"id":"kth-largest-add-is-log-k","text":"Each `add` call performs at most one push and one pop on a heap of size k, giving O(log k) time regardless of total stream length.","truth_value":"IN","source":"entries/2026/06/06/kth-largest-element-in-a-stream-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"kth-largest-add-is-log-k","truth_value":"IN","reason":"premise"}]}}