Design a data structure with the following operations:\n```\nadd(value);\nremove(value);\nget(value);\ngetMinValue(); // return the minimum value in data set\n```\n\n**Follow-up:**\nImplement \n```\ngetLatestValue(); // return the value inserted last\n```\n\n**Example:**\n```\n/* initialy data set is empty */\nadd(2);\nadd(3);\nadd(1);\ngetLatestValue(); // return 1\ngetMinValue(); // return 1\nremove(1);\ngetLatestValue(); // return 3\ngetMinValue(); // return 2\n```

Design a data structure with the following operations:\n\nadd(value);\nremove(value);\nget(value);\ngetMinValue(); // return the minimum value in data set\n\n\n