/**

​

[Requirements]

    Given an array A of integers and integer K, return the maximum S such that there exists i < j with A[i] + A[j] = S and S < K.

    If no such i, j exist satisfying this equation, return -1.

[Example 1]

    Input: A = [34,23,1,24,75,33,54,8], K = 60

    Output: 58

    Explanation: We can use 34 and 24 to sum 58 which is less than 60 and there's no pair with sum of 59. Therefore, the maximum sum is 58.

[Example 2]

    Input: A = [10,20,30], K = 15

    Output: -1

    Explanation: In this case it's not possible to get a pair sum less than 15.

​

[Constraints]

    1 <= A.length <= 100

    1 <= A[i] <= 1000

    1 <= K <= 20005

​

**/

using System;

using System.Collections;

using System.Collections.Generic;

using System.Linq;

​

class Solution

{

    public static int TwoSumLessThan(int[] a, int k)

    {

        var result = -1;

        return result;

    }

}

​

public class TwoSumLessThan

{

    public static void Main(string[] args)

    {

        int [] nums = new int[] { 34, 23, 1, 24, 75, 33, 54, 8 };

        int k = 60;

        Console.WriteLine(Solution.TwoSumLessThan(nums, k));

    }

}

​