How to find the maximum value we can achieve by picking k elements from an array in C#

1 Answer

0 votes
using System;

class Program
{
    static int MaxSumOfK(int[] arr, int k) {
        Array.Sort(arr);          // ascending
        Array.Reverse(arr);       // now descending

        int sum = 0;
        for (int i = 0; i < k; i++) {
            sum += arr[i];
        }

        return sum;
    }

    static void Main()
    {
        int[] arr = { 11, 2, 4, 9, 3, 6, 5, 1 };
        int k = 3;

        int result = MaxSumOfK(arr, k);
        Console.WriteLine(result);  
    }
}



/*
run:

26

*/

 



answered Apr 5 by avibootz

Related questions

...