diff --git a/Heap.java b/Heap.java
new file mode 100644
index 0000000000000000000000000000000000000000..dd6535a552beb51a5e5d252b8d721d8bbab0472b
--- /dev/null
+++ b/Heap.java
@@ -0,0 +1,30 @@
+
+public class Heap<T extends Comparable<T>>{
+  public T[] heap;
+  public int SIZE;
+  public int count;
+
+  Heap(int size){
+    SIZE = size;
+    // reference: https://stackoverflow.com/questions/34827626/cannot-be-cast-to-ljava-lang-comparable
+    heap = (T[])new Comparable[SIZE];
+    count = 0;
+  }
+
+
+  public void add (T item){
+    if(count >= SIZE){
+      // throw new Exception("Heap Overflow");
+      System.out.println("Heap Full");
+      return;
+    }
+
+  }
+
+  public void delete(T item){
+    
+  }
+
+  public void print(){
+  }
+}
\ No newline at end of file
diff --git a/README.md b/README.md
index e931f2f0393b17470887781a3e4325a8e502941d..41aca87a2caf0d420ec69ba324b7a612a5db5f15 100644
--- a/README.md
+++ b/README.md
@@ -7,11 +7,12 @@
 
 ### 截止日期
 
-下次实验课上课前（12.16)
+- 基础-1 下次实验课上课前（12.16)
+- 基础-2 12.23
 
 ### 基础
 
-1. 实现⼀个小顶堆或者⼤顶堆
+1. 实现小顶堆或者大顶堆
  - (1) 定义堆的数据结构
  - (2) 实现入堆函数
  - (3) 实现出堆函数
@@ -20,7 +21,7 @@
 ### 进阶
 
 1. 利用优先级队列合并K个有序数组
-2. 求⼀组动态数据集合的最⼤Top K
+2. 求一组动态数据集合的Top K
 
 ## 工作流程
 
diff --git "a/\350\257\276\344\273\266/lecture07-pq.pdf" "b/\350\257\276\344\273\266/lecture07-pq.pdf"
index bf751be1e6720ccb13d80c752dc2587677aabb6e..ff104a93484385d71f6b62d9e979159663f0164b 100644
Binary files "a/\350\257\276\344\273\266/lecture07-pq.pdf" and "b/\350\257\276\344\273\266/lecture07-pq.pdf" differ