Advertisement
SuitNdtie

Risk

May 11th, 2019
121
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 0.50 KB | None | 0 0
  1. #include<stdio.h>
  2. #define inf 1e9+1
  3. int min(int a,int b){
  4.     return (a < b ? a : b);
  5. }
  6. int main()
  7. {
  8.     int n,m;
  9.     scanf("%d %d",&n,&m);
  10.     int dp[n+1][m+1];
  11.     for(int i = 0 ; i <= n ; i ++)dp[i][0] = inf;
  12.     for(int i = 0 ; i <= m ; i ++)dp[0][i] = inf;
  13.  
  14.     for(int i = 1 ; i <= n ; i ++){
  15.         for(int j = 1 ; j <= m ; j ++){
  16.             int x;
  17.             scanf("%d",&x);
  18.             if(i == 1 && j == 1)dp[i][j] = x;
  19.             else{
  20.                 dp[i][j] = min(dp[i-1][j],dp[i][j-1]) + x;
  21.             }
  22.         }
  23.     }
  24.     printf("%d",dp[n][m]);
  25.     return 0;
  26. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement