Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- int main() {
- int n, m;
- cin >> n >> m;
- vector<vector<int>> c(n + 1, vector<int>(m + 1));
- vector<vector<int>> dp(n + 1, vector<int>(m + 1, INF));
- for(int i = 1; i <= n; ++i){
- for(int j = 1; j <= m; ++j){
- cin >> c[i][j];
- }
- }
- for(int i = 1; i <= n; ++i){
- for(int j = 1; j <= m; ++j){
- if(i == j && i == 1){
- dp[i][j] = c[i][j];
- continue;
- }
- dp[i][j] = min(dp[i-1][j], dp[i][j-1]) + c[i][j];
- }
- }
- cout << dp[n][m];
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment