2463 Minimum Total Distance Traveled

2463 Minimum Total Distance Traveled. This Java code calculates the minimum total distance for fixing robots using factories. It sorts the robots and factories for optimal assignment, then uses dynamic programming to find the minimum distance.

Explanation:
1. Sort both robots and factories for optimal assignment
2. Uses a 2D DP array where dp[i][j] represents the minimum distance needed to fix robots[i:] using factories[j:]
3. For each state, considers two options:
- Skip current factory
- Use current factory to fix k robots (1 ≤ k ≤ limit)
4. Handles large numbers using long to prevent overflow

Time Complexity: O(N * M * L) where:
- N is number of robots
- M is number of factories
- L is maximum limit of any factory

Space Complexity: O(N * M) for the DP array.