Advertisement
Guest User

Untitled

a guest
Nov 15th, 2018
80
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.79 KB | None | 0 0
  1. #include <iostream>
  2.  
  3. using namespace std;
  4.  
  5. struct Bani
  6. {
  7. int ban;
  8. } b[100], aux;
  9.  
  10. int main()
  11. {
  12. int n,i,j,S,contor=0,k=0;
  13. cin >> n >> S;
  14. for (i=1 ; i<=n; i++)
  15. cin >> b[i].ban;
  16. for (i=1 ; i<n ; i++)
  17. for (j=i+1 ; j<=n ; j++)
  18. if (b[i].ban < b[j].ban)
  19. {
  20. aux = b[i];
  21. b[i] = b[j];
  22. b[j] = aux ;
  23. }
  24. i=1;
  25. while (S)
  26. {
  27. if(S >= b[i].ban)
  28. {
  29. S-=b[i].ban;
  30. contor++;
  31. k++;
  32. }
  33. else
  34. {
  35. cout <<contor << "*" << b[i].ban << endl ;
  36. contor=0;
  37. i++;
  38. }
  39. }
  40. cout <<contor << "*" << b[i].ban << endl ;
  41. cout << k;
  42.  
  43. return 0;
  44. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement