Design and implement a system that functions as a Least Recently Used (LRU) cache. The system should support retrieving values by key and inserting or updating key-value pairs. If the cache reaches its predefined capacity, it must automatically discard the item that has not been accessed for the longest period. Ensure that both retrieval and insertion operations are optimized to perform in constant time on average.