Website Summary Files Commits Branches @commit @diff @stats
path: root / Sem. 10
diff options
context:
space:
mode:
Commit0f347ab59c2e655ce1e7546fb700b3f1d1d2f324 (patch)
Author
 Angel Dimitriev <achi_d@abv.bg>
2021-05-12 19:49:41 +0300
Committer
 GitHub <noreply@github.com>
2021-05-12 19:49:41 +0300
Files0645925cf23da6ec6af491d9eedb64ab963db67b /Sem. 10
Object-oriented_programming_FMI-0f347ab59c2e655ce1e7546fb700b3f1d1d2f324.tar
Object-oriented_programming_FMI-0f347ab59c2e655ce1e7546fb700b3f1d1d2f324.tar.gz
Object-oriented_programming_FMI-0f347ab59c2e655ce1e7546fb700b3f1d1d2f324.zip
Parentce7db49ffcefb5133210a9cc4bb426ac9aa7794d (diff)
Update README.md
1 files changed, 24 insertions, 0 deletions
-rw-r--r--Sem. 10/README.md24
diff --git a/Sem. 10/README.md b/Sem. 10/README.md
index 87266f6..40d6502 100644
--- a/Sem. 10/README.md
+++ b/Sem. 10/README.md
@@ -44,3 +44,27 @@ int main()
cout << q.isEmpty() << endl; //1
}
```
+ **Задача 2:**
+ Създайте **шаблонна** опашка с k приоритета. При взимане на елемент от опашката трябва да се връща най-отдавна добавения елемент от тези с най-висок приоритет.
+
+ ```c++
+int main()
+{
+ kPriorityQueue<char> q(4); // 4 priorities - 0, 1, 2 и 3.
+
+ q.enqueue('A',0): //adds A with lowest priority: 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
+}
+ ```
+