The finite-time synchronization (FTS) is considered for proportional delay memristive competitive neural networks (PDMCNNs). By utilizing Lyapunov functional method and differential inclusion theory, two new criteria ensuring the FTS of PDMCNNs are established. These criteria with algebraic inequality forms are less complicated and easier to verify than the matrix inequality forms. In addition, the corresponding settling times have been estimated. Eventually, the effectiveness of the presented criteria and controllers is confirmed through two numerical examples, and one application about image encryption is provided.