day01/solution_gemini-1.5-pro.py

def solve():
    file = "./input.txt"
    left_list = []
    right_list = []

    with open(file, 'r') as f:
        for line in f:
            left, right = map(int, line.strip().split())
            left_list.append(left)
            right_list.append(right)
    
    # Part 1
    left_list_sorted = sorted(left_list)
    right_list_sorted = sorted(right_list)
    total_distance = 0
    for i in range(len(left_list)):
        total_distance += abs(left_list_sorted[i] - right_list_sorted[i])
    print(total_distance)

    # Part 2
    similarity_score = 0
    for left_num in left_list:
        count = right_list.count(left_num)
        similarity_score += left_num * count
    print(similarity_score)

solve()