@[beaulo1235](/user/611585)
```cpp
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,m;
scanf("%d %d",&n,&m);
int dp[n+1][m+1];
int a[n+1][m+1];
for(int i=1;i<=m;i++){
for(int j=1;j<=n;j++){
scanf("%d",&a[j][i]);
}
}
for(int i=1;i<=n;++i){
for(int j=1;j<=m;++j){
dp[i][j]=min(dp[i-1][j],j==1?dp[i-1][m]:dp[i-1][j-1])+a[i][j];
}
}
int ans=1234567890;
for(int i=1;i<=m;++i){
ans=min(dp[n][i],ans);//你取min取成了啥玩意
}
printf("%d",ans);
return 0;
}
```
by Loser_Syx @ 2023-03-09 19:02:00
@[Saint_ying_xtf](/user/852144) 刚刚用这个跑了一下案例 好像出来的还是14(OJ上跑AC了) 然后那个取min的 想问问我的那个有哪错吗(不懂就问)
by beaulo1235 @ 2023-03-09 19:58:24
@[beaulo1235](/user/611585) 你自己看看你对的哪两个玩意取min
by Loser_Syx @ 2023-03-09 19:59:42
@[Saint_ying_xtf](/user/852144) 懂了我??了 那为什么案例跑出来是14
by beaulo1235 @ 2023-03-09 20:09:15
@[beaulo1235](/user/611585) 不知道(
by Loser_Syx @ 2023-03-09 20:13:16