Solution 3 for Scaler Topics Fortnightly Contest - 17
FREE
Powerball Tournament Complete Solution
This article is part of the Scaler Topics Fortnightly Contest - 17
Build an AI-First Career, Master the Complete Skillset
Choose from our industry-leading programs designed for career success
Modern Software and AI Engineering Program
Master full-stack development with AI integration
+1000 moreModern Data Science and ML with specialisation in AI
Advanced data science techniques with AI specialization
+1000 moreAdvanced AIML with Specialisation in Agentic AI
Deep dive into AIML with focus on Agentic systems
+1000 moreDevOps, Cloud & AI Platform Engineering
Build and manage AI-powered cloud infrastructure
+1000 moreAI Engineering Advanced Certification by IIT-Roorkee
Premier AI engineering certification from IIT-Roorkee
AI Forward Deployed Engineer Program
Full-stack engineering, production AI and client-facing consulting
+1000 moreSolution Approach
This leads to a following greedy approach:
- Divide all the N powerballs by its type(B[i]).
- Sort all the groups in non-increasing order.
As a result now we can maintain a current length, and for it iterate over the prefix sum of current length in all the groups, and update the global answer.
Time Complexity: O(Nlog(N)). Space Complexity: O(N).
C++ Implementation
Java Implementation
How Scaler Transformed Careers in Different Fields
Scaler learners achieved 2.5x salary growth with average post-Scaler CTC reaching ₹23L.
Google
Amazon
Microsoft
Flipkart
Adobe1200+ more
