A **fancy string** is a string where no **three** **consecutive** characters are equal.

Given a string `s`, delete the **minimum** possible number of characters from `s` to make it **fancy**.

Return _the final string after the deletion_. It can be shown that the answer will always be **unique**.

**Example 1:**

**Input:** s =  "leeetcode "
**Output:**  "leetcode "
**Explanation:**
Remove an 'e' from the first group of 'e's to create  "leetcode ".
No three consecutive characters are equal, so return  "leetcode ".

**Example 2:**

**Input:** s =  "aaabaaaa "
**Output:**  "aabaa "
**Explanation:**
Remove an 'a' from the first group of 'a's to create  "aabaaaa ".
Remove two 'a's from the second group of 'a's to create  "aabaa ".
No three consecutive characters are equal, so return  "aabaa ".

**Example 3:**

**Input:** s =  "aab "
**Output:**  "aab "
**Explanation:** No three consecutive characters are equal, so return  "aab ".

**Constraints:**

*   `1 <= s.length <= 105`
*   `s` consists only of lowercase English letters.


def smallest_difference_room(rooms, queries):
    n = len(rooms)
    k = len(queries)
    rooms.sort(key=lambda x: x[0])
    results = []

    for i in range(k):
        preferred, minSize = queries[i]
        diff = float("inf")
        room_idx = -1

        for j in range(n):
            if rooms[j][1] >= minSize:
                tmp_diff = abs(preferred - rooms[j][0])
                if tmp_diff < diff:
                    diff = tmp_diff
                    room_idx = rooms[j][0]

        results.append(room_idx)

    return results
