Advertisement
Guest User

Untitled

a guest
Dec 10th, 2019
79
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.68 KB | None | 0 0
  1. #include <bits/stdc++.h>
  2. #include <queue>
  3. #define INF 99999999
  4. #define LL long long
  5. using namespace std;
  6.  
  7. int tab[2010][2010];
  8.  
  9. int main(){
  10. ios_base::sync_with_stdio(false);
  11. int n,k,x;
  12. cin >> n >> k;
  13. for(int i=1;i<=n;i++){
  14. for(int j=1;j<=i;j++){
  15. cin >> x;
  16. tab[i][j]=x;
  17. }
  18. }
  19. int mini = tab[1][1];
  20. tab[1][1]=1;
  21. for(int i=1;i<=n;i++){
  22. for(int j=1;j<=i;j++){
  23. int w = tab[i-1][j]+tab[i-1][j-1]-tab[i-1][j-1];
  24. if(w<=k && tab[i][j]<mini){
  25. mini = tab[i][j];
  26. }
  27. tab[i][j] = w;
  28. }
  29. }
  30. cout << mini;
  31. return 0;
  32. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement