Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- #include <queue>
- #define INF 99999999
- #define LL long long
- using namespace std;
- int tab[2010][2010];
- int main(){
- ios_base::sync_with_stdio(false);
- int n,k,x;
- cin >> n >> k;
- for(int i=1;i<=n;i++){
- for(int j=1;j<=i;j++){
- cin >> x;
- tab[i][j]=x;
- }
- }
- int mini = tab[1][1];
- tab[1][1]=1;
- for(int i=1;i<=n;i++){
- for(int j=1;j<=i;j++){
- int w = tab[i-1][j]+tab[i-1][j-1]-tab[i-1][j-1];
- if(w<=k && tab[i][j]<mini){
- mini = tab[i][j];
- }
- tab[i][j] = w;
- }
- }
- cout << mini;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement