CN-TST 2019 Problem 20

A graph $G(V,E)$ is triangle-free, but adding any edges to the graph will form a triangle. It's given that $|V|=2019$ , $|E|>2018$ , find the minimum of $|E|$ .