### PROBLEM LINK:

**Author:** Anudeep Nekkanti

**Tester:** Anudeep Nekkanti

**Editorialist:** Jingbo Shang

### DIFFICULTY:

Cakewalk

### PREREQUISITES:

Programming

### PROBLEM:

Given an array **A[1…N]**, find three elements such that their sum is maximized.

### EXPLANATION:

Select the maximum 3 numbers using for loops. Each time, go through all elements and find the maximum one. Then, remove it (mark it), do the second/third times. After that, we will have the maximum 3 numbers.

### AUTHOR’S AND TESTER’S SOLUTIONS:

Solutions will be available soon.

Author’s solution can be found here.

Tester’s solution can be found here.