MUN Debate Score Optimization
MUN Debate Score Optimization
HardArrays0% accepted
Meera judges a Delhi MUN debate where speakers give talks each round. She can overlook the 2 worst-performing rounds per speaker. Find the maximum score achievable.
Approach
Given an array of speaker scores across debate rounds, find the maximum sum possible by ignoring at most 2 scores.
Input
6
8 3 7 9 2 5
Output
29
More Arrays problems
Browse all coding problems →solution.py
Loading editor...
Test 1
Test 2
Test 3
Press Run to test your custom input, or Submit to judge against all test cases.
Sign in to continue
Create a free account to run code, submit solutions and track progress.
- Free forever — no credit card
- 10+ languages with live execution
- Points, streaks & leaderboards