Design a cache system that stores key-value pairs with a fixed capacity. When the cache reaches its limit, it should evict the least recently used (LRU) entry. Implement methods to get a value by key, set a new key-value pair, and delete a specific key from the cache using a data structure of your choice.