Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<stdio.h>
- #define inf 1e9+1
- int min(int a,int b){
- return (a < b ? a : b);
- }
- int main()
- {
- int n,m;
- scanf("%d %d",&n,&m);
- int dp[n+1][m+1];
- for(int i = 0 ; i <= n ; i ++)dp[i][0] = inf;
- for(int i = 0 ; i <= m ; i ++)dp[0][i] = inf;
- for(int i = 1 ; i <= n ; i ++){
- for(int j = 1 ; j <= m ; j ++){
- int x;
- scanf("%d",&x);
- if(i == 1 && j == 1)dp[i][j] = x;
- else{
- dp[i][j] = min(dp[i-1][j],dp[i][j-1]) + x;
- }
- }
- }
- printf("%d",dp[n][m]);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement