Advertisement
Lazov

Problem 1. Exercises: Stacks and Queues

Jan 17th, 2019
118
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.40 KB | None | 0 0
  1. using System;
  2. using System.Collections.Generic;
  3. using System.Linq;
  4.  
  5. namespace _01._Basic_Stack_Operations
  6. {
  7. class Basic
  8. {
  9. static void Main(string[] args)
  10. {
  11. int[] numbers = Console.ReadLine().Split().Select(int.Parse).ToArray();
  12. int[] numForQueue = Console.ReadLine().Split().Select(int.Parse).ToArray();
  13. int minElement = int.MaxValue;
  14. bool result = false;
  15.  
  16. Stack<int> stack = new Stack<int>(numForQueue);
  17.  
  18. for (int i = 0; i < numbers[1]; i++)
  19. {
  20. stack.Pop();
  21. }
  22.  
  23. if (stack.Count == 0)
  24. {
  25. Console.WriteLine(0);
  26. return;
  27. }
  28.  
  29. for (int i = 0; i < stack.Count; i++)
  30. {
  31. int currentElement = stack.Pop();
  32.  
  33. if (currentElement == numbers[2])
  34. {
  35. result = true;
  36. break;
  37. }
  38. if (currentElement < minElement)
  39. {
  40. minElement = currentElement;
  41. }
  42.  
  43. }
  44.  
  45. if (result == true)
  46. {
  47. Console.WriteLine("true");
  48. }
  49. else
  50. {
  51. Console.WriteLine(minElement);
  52. }
  53.  
  54. }
  55. }
  56. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement