Added time complexity in comments.

Shivangidubey08 · abranhe · commit b4fa7fecda5f · 2020-10-13T22:52:38.000-04:00
diff --git a/data-structures/Priority_Queues/kthLargestUsingPriorityQueue.cpp b/data-structures/Priority_Queues/kthLargestUsingPriorityQueue.cpp
@@ -41,4 +41,4 @@ int main() {
     cout << kthLargest(arr, n, k) << endl;
 }
 
-
+// Time complexity of this solution is O(nlogn).

Original file line number	Diff line number	Diff line change
`@@ -41,4 +41,4 @@ int main() {`
`41`	`41`	`cout << kthLargest(arr, n, k) << endl;`
`42`	`42`	`}`
`43`	`43`
`44`		`-`
	`44`	`+// Time complexity of this solution is O(nlogn).`