b.py 1.1 KB

12345678910111213141516171819202122232425262728293031323334353637383940
  1. import os, argparse
  2. def solve_task(filename):
  3. with open(filename) as infile:
  4. all_elves = []
  5. current_elf = 0
  6. highest = 0
  7. for raw_line in infile:
  8. line = raw_line.rstrip()
  9. if line != "":
  10. current_elf += int(line)
  11. else:
  12. all_elves.append(current_elf)
  13. highest = max(current_elf, highest)
  14. current_elf = 0
  15. all_elves.append(current_elf)
  16. highest = max(current_elf, highest)
  17. current_elf = 0
  18. all_elves.sort(reverse=True)
  19. to_sum = all_elves[0:3]
  20. three_highest = sum(to_sum)
  21. print(f"Three highest ammount {three_highest}")
  22. def parse_arguments():
  23. parser = argparse.ArgumentParser(description="Script that solves the case",epilog="Have a nice day!")
  24. parser.add_argument('filename', nargs='?', default="example.txt", help='Input file')
  25. args = parser.parse_args()
  26. return args
  27. def main():
  28. args = parse_arguments()
  29. solve_task(args.filename)
  30. if __name__ == "__main__":
  31. main()