diff --git a/AC-Submissions/problems/path_with_minimum_effort/solution.cpp b/AC-Submissions/problems/path_with_minimum_effort/solution.cpp
new file mode 100644
index 0000000..cb691d9
--- /dev/null
+++ b/AC-Submissions/problems/path_with_minimum_effort/solution.cpp
@@ -0,0 +1,41 @@
+// Dijkstra's algorithm
+class Solution {
+public:
+    using int2=array<int, 2>;
+    int n, m;
+    int to1D(int i, int j){
+        return i*m+j;
+    }
+    int minimumEffortPath(vector<vector<int>>& heights) {
+        n=heights.size(), m=heights[0].size();
+        if (n==1 && m==1) return 0;// edge case
+        int dist[10000];
+        fill(dist+1, dist+10000, INT_MAX);
+        bool visited[10000]={0};
+        int dir[][2]={{-1, 0},{1, 0},{0, -1},{0, 1}};
+        priority_queue<int2, vector<int2>, greater<int2>> pq;
+        pq.push({0, 0});// (dist, to1D(i, j))
+
+        while (!pq.empty()) {
+            auto [d, idx] = pq.top();
+            auto [i, j]=div(idx, m);
+            pq.pop();
+            if (d>dist[idx]) continue;
+            if (idx==n*m-1) return d;
+            visited[idx]=1;
+            int d2;
+            for (auto& dd: dir){
+                int r=i+dd[0], s=j+dd[1];
+                int&& idx2=to1D(r, s);
+                if(r<0||r>=n||s<0||s>=m||visited[idx2]) continue;
+                int w=abs(heights[i][j]-heights[r][s]);
+                d2=max(d, w);
+                if (d2 < dist[idx2]) {
+                    dist[idx2] = d2;
+                    pq.push({d2, idx2});
+                }
+            }
+        }
+        return 0;
+    }
+};
\ No newline at end of file