Website Summary Files Commits Branches @commit @diff @stats
path: root / Sem. 09
diff options
context:
space:
mode:
Commit0ef1d53ea9e41c170f77bd628a9915e4c7321a63 (patch)
Author
 Angel Dimitriev <achi_d@abv.bg>
2021-04-28 09:47:10 -0400
Committer
 GitHub <noreply@github.com>
2021-04-28 09:47:10 -0400
Files3dbac6244faa0b9e5b7f4dce8d970db9eb9cef45 /Sem. 09
Object-oriented_programming_FMI-0ef1d53ea9e41c170f77bd628a9915e4c7321a63.tar
Object-oriented_programming_FMI-0ef1d53ea9e41c170f77bd628a9915e4c7321a63.tar.gz
Object-oriented_programming_FMI-0ef1d53ea9e41c170f77bd628a9915e4c7321a63.zip
Parent2d866a5dd8f70046c16c8cd8e85c8f6fc6bca953 (diff)
Update README.md
1 files changed, 22 insertions, 0 deletions
-rw-r--r--Sem. 09/README.md22
diff --git a/Sem. 09/README.md b/Sem. 09/README.md
index 33955e6..49877e0 100644
--- a/Sem. 09/README.md
+++ b/Sem. 09/README.md
@@ -268,3 +268,25 @@ int main()
cout << s3 << endl;
}
```
+ **Задача 4:**
+ Създайте опашка с k приоритети. При взимане на елемент от опашката трябва да се връща последно добавеният елемент от тези с най-висок приоритет.
+ ```c++
+int main()
+{
+ kPriorityQueue<char> q(4); // 4 priorities - 0, 1, 2 и 3.
+
+ q.enqueue('A',0):
+ q.enqueue('B',3);
+ q.enqueue('C',2);
+ q.enqueue('D',2);
+ q.enqueue('E',1);
+
+ //q.enqueue('F', 5); //error! No such priority!
+
+ q.dequeue(); // B
+ q.dequeue(); // C
+ q.dequeue(); // D
+ q.dequeue(); // E
+ q.dequeue(); // A
+}
+ ```