Dinner Dishes

You are planning a dinner menu for an event, and you have a list of N dishes stored in array A vach with a certain cost associated with it$.$ You must select two such dishes, such that the sum of their costs is maximum among all available pairs Your task is to find and return an integer value representing the sum of such available pair. Return $0$ in case of no such pair available.

Input Specification:

input$1$: An integer array A representing the cost of dishes

input$2$: An integer value N representing the number of dishes available.

Output Specification:

Return an integer value representing sum of such pair available. In case, there are no such pair present, return $0$

Example $1$:

input$1$: $(1,105\mathrm{.}15)$

input$2$:$4$

Output:$25$