Create MinCostPath.cpp

Graphs/MinCostPath.cpp

@@ -0,0 +1,36 @@
+
+
+class Solution
+{
+    public:
+    //Function to return the minimum cost to react at bottom
+	//right cell from top left cell.
+    int minimumCostPath(vector<vector<int>>& grid) 
+    {
+        // Code here
+        int n=grid.size();
+        priority_queue<pair<int,pair<int,int>>,vector<pair<int,pair<int,int>>>,greater<pair<int,pair<int,int>>>>pq;
+        pq.push({grid[0][0],{0,0}});
+        int dr[]={-1,0,0,1};
+        int dc[]={0,-1,1,0};
+        vector<vector<int>>dist(n,vector<int>(n,1e9));
+        dist[0][0]=grid[0][0];
+        while(!pq.empty()){
+            int dis=pq.top().first;
+            int row=pq.top().second.first;
+            int col=pq.top().second.second;
+            pq.pop();
+            for(int i=0;i<4;i++){
+                int nrow=row+dr[i];
+                int ncol=col+dc[i];
+                if(nrow>=0 && nrow<n && ncol>=0 && ncol<n){
+                    if(dis+grid[nrow][ncol]<dist[nrow][ncol]){
+                        dist[nrow][ncol]=dis+grid[nrow][ncol];
+                        pq.push({dist[nrow][ncol],{nrow,ncol}});
+                    }
+                }
+            }
+        }
+        return dist[n-1][n-1];
+    }
+};