Geeksforgeeks

Error

×

Leaderboard

Showing:

Handle | Score |
---|---|

@Ibrahim Nash | 6454 |

@blackshadows | 6380 |

@mb1973 | 5714 |

@Quandray | 5245 |

@akhayrutdinov | 5111 |

@saiujwal13083 | 5046 |

@sanjay05 | 3762 |

@kirtidee18 | 3709 |

@mantu_singh | 3556 |

@marius_valentin_dragoi | 3523 |

@sushant_a | 3459 |

Complete Leaderboard | |

Handle | Score |

@cfwong8 | 1285 |

@gurshehzadsingh | 1052 |

@pritsahkar2000 | 812 |

@satyamchhatrala | 804 |

@nithinreddy3210 | 801 |

@iib2019024 | 745 |

@mohanreddy8847 | 704 |

@iamchaitanyahegde | 662 |

@shafeeq3543 | 647 |

@workit | 646 |

@AkashLahoty | 642 |

Complete Leaderboard |

Given an array **arr** of positive integers of size **N** and an integer **K**, the task is to find the sum of all subsets of size **K**.

**Input: **

1. The first line of the input contains a single integer* * **T** denoting the number of test cases. The description of **T** test cases follows.

2. The first line of each test case contains two integers** N **and **K.**

3. The next line contains **N** space-separated integers.

**Output:** For each test case, print** **the answer

**Constraints:**

1. 1 <= T <= 10

2. 1 <= K <= N <= 12

3. 1 <= arr[i] <= 100

**Example:
Input:**

2

4 2

1 2 3 5

1 1

20

**Output:**

33

20

**Explanation:**

**Test Case 1:** Subsets are {1, 2}, {1, 3}, {1, 5}, {2, 3}, {2, 5}, {3, 5}, Summation of all subsets sum = 3 + 4 + 6 + 5 + 7 + 8 = 33

Login to report an issue on this page.

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

YesLoading...

Geek and Subset Sum

...