// Design a data structure that follows the constraints of a Least Recently Used (LRU) cache.
 
// Implement the LRUCache class:
 
// LRUCache(int capacity) Initialize the LRU cache with positive size capacity.
// int get(int key) Return the value of the key if the key exists, otherwise return -1.
// void put(int key, int value) Update the value of the key if the key exists. Otherwise, add the key-value pair to the cache. If the number of keys exceeds the capacity from this operation, evict the least recently used key.
// The functions get and put must each run in O(1) average time complexity.
 
 
 
// Example 1:
 
// Input
// ["LRUCache", "put", "put", "get", "put", "get", "put", "get", "get", "get"]
// [[2], [1, 1], [2, 2], [1], [3, 3], [2], [4, 4], [1], [3], [4]]
// Output
// [null, null, null, 1, null, -1, null, -1, 3, 4]
 
// Explanation
// LRUCache lRUCache = new LRUCache(2);
// lRUCache.put(1, 1); // cache is {1=1}
// lRUCache.put(2, 2); // cache is {1=1, 2=2}
// lRUCache.get(1);    // return 1
// lRUCache.put(3, 3); // LRU key was 2, evicts key 2, cache is {1=1, 3=3}
// lRUCache.get(2);    // returns -1 (not found)
// lRUCache.put(4, 4); // LRU key was 1, evicts key 1, cache is {4=4, 3=3}
// lRUCache.get(1);    // return -1 (not found)
// lRUCache.get(3);    // return 3
// lRUCache.get(4);    // return 4
 
#include <iostream>
using namespace std;
 
int main() {
	// your code goes here
	return 0;
}

Ly8gRGVzaWduIGEgZGF0YSBzdHJ1Y3R1cmUgdGhhdCBmb2xsb3dzIHRoZSBjb25zdHJhaW50cyBvZiBhIExlYXN0IFJlY2VudGx5IFVzZWQgKExSVSkgY2FjaGUuCgovLyBJbXBsZW1lbnQgdGhlIExSVUNhY2hlIGNsYXNzOgoKLy8gTFJVQ2FjaGUoaW50IGNhcGFjaXR5KSBJbml0aWFsaXplIHRoZSBMUlUgY2FjaGUgd2l0aCBwb3NpdGl2ZSBzaXplIGNhcGFjaXR5LgovLyBpbnQgZ2V0KGludCBrZXkpIFJldHVybiB0aGUgdmFsdWUgb2YgdGhlIGtleSBpZiB0aGUga2V5IGV4aXN0cywgb3RoZXJ3aXNlIHJldHVybiAtMS4KLy8gdm9pZCBwdXQoaW50IGtleSwgaW50IHZhbHVlKSBVcGRhdGUgdGhlIHZhbHVlIG9mIHRoZSBrZXkgaWYgdGhlIGtleSBleGlzdHMuIE90aGVyd2lzZSwgYWRkIHRoZSBrZXktdmFsdWUgcGFpciB0byB0aGUgY2FjaGUuIElmIHRoZSBudW1iZXIgb2Yga2V5cyBleGNlZWRzIHRoZSBjYXBhY2l0eSBmcm9tIHRoaXMgb3BlcmF0aW9uLCBldmljdCB0aGUgbGVhc3QgcmVjZW50bHkgdXNlZCBrZXkuCi8vIFRoZSBmdW5jdGlvbnMgZ2V0IGFuZCBwdXQgbXVzdCBlYWNoIHJ1biBpbiBPKDEpIGF2ZXJhZ2UgdGltZSBjb21wbGV4aXR5LgoKIAoKLy8gRXhhbXBsZSAxOgoKLy8gSW5wdXQKLy8gWyJMUlVDYWNoZSIsICJwdXQiLCAicHV0IiwgImdldCIsICJwdXQiLCAiZ2V0IiwgInB1dCIsICJnZXQiLCAiZ2V0IiwgImdldCJdCi8vIFtbMl0sIFsxLCAxXSwgWzIsIDJdLCBbMV0sIFszLCAzXSwgWzJdLCBbNCwgNF0sIFsxXSwgWzNdLCBbNF1dCi8vIE91dHB1dAovLyBbbnVsbCwgbnVsbCwgbnVsbCwgMSwgbnVsbCwgLTEsIG51bGwsIC0xLCAzLCA0XQoKLy8gRXhwbGFuYXRpb24KLy8gTFJVQ2FjaGUgbFJVQ2FjaGUgPSBuZXcgTFJVQ2FjaGUoMik7Ci8vIGxSVUNhY2hlLnB1dCgxLCAxKTsgLy8gY2FjaGUgaXMgezE9MX0KLy8gbFJVQ2FjaGUucHV0KDIsIDIpOyAvLyBjYWNoZSBpcyB7MT0xLCAyPTJ9Ci8vIGxSVUNhY2hlLmdldCgxKTsgICAgLy8gcmV0dXJuIDEKLy8gbFJVQ2FjaGUucHV0KDMsIDMpOyAvLyBMUlUga2V5IHdhcyAyLCBldmljdHMga2V5IDIsIGNhY2hlIGlzIHsxPTEsIDM9M30KLy8gbFJVQ2FjaGUuZ2V0KDIpOyAgICAvLyByZXR1cm5zIC0xIChub3QgZm91bmQpCi8vIGxSVUNhY2hlLnB1dCg0LCA0KTsgLy8gTFJVIGtleSB3YXMgMSwgZXZpY3RzIGtleSAxLCBjYWNoZSBpcyB7ND00LCAzPTN9Ci8vIGxSVUNhY2hlLmdldCgxKTsgICAgLy8gcmV0dXJuIC0xIChub3QgZm91bmQpCi8vIGxSVUNhY2hlLmdldCgzKTsgICAgLy8gcmV0dXJuIDMKLy8gbFJVQ2FjaGUuZ2V0KDQpOyAgICAvLyByZXR1cm4gNAoKI2luY2x1ZGUgPGlvc3RyZWFtPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKaW50IG1haW4oKSB7CgkvLyB5b3VyIGNvZGUgZ29lcyBoZXJlCglyZXR1cm4gMDsKfQ==