diff --git a/README.md b/README.md
index 6e1349f..296e0fc 100644
--- a/README.md
+++ b/README.md
@@ -491,6 +491,7 @@
 | 2448 | Minimum Cost to Make Array Equal | [Ruby](./algorithms/ruby/2448-minimum-cost-to-make-array-equal.rb) | Hard |
 | 2458 | Height of Binary Tree After Subtree Removal Queries | [Ruby](./algorithms/ruby/2458-height-of-binary-tree-after-subtree-removal-queries.rb) | Hard |
 | 2462 | Total Cost to Hire K Workers | [Python3](./algorithms/python3/2462-total-cost-to-hire-k-workers.py) | Medium |
+| 2463 | Minimum Total Distance Traveled | [Ruby](./algorithms/ruby/2463-minimum-total-distance-traveled.rb) | Hard |
 | 2466 | Count Ways To Build Good Strings | [Ruby](./algorithms/ruby/2466-count-ways-to-build-good-strings.rb) | Medium |
 | 2477 | Minimum Fuel Cost to Report to the Capital | [Ruby](./algorithms/ruby/2477-minimum-fuel-cost-to-report-to-the-capital.rb) | Medium |
 | 2483 | Minimum Penalty for a Shop | [Ruby](./algorithms/ruby/2483-minimum-penalty-for-a-shop.rb) | Medium |
diff --git a/algorithms/ruby/2463-minimum-total-distance-traveled.rb b/algorithms/ruby/2463-minimum-total-distance-traveled.rb
new file mode 100644
index 0000000..7e6450f
--- /dev/null
+++ b/algorithms/ruby/2463-minimum-total-distance-traveled.rb
@@ -0,0 +1,92 @@
+# frozen_string_literal: true
+
+# 2463. Minimum Total Distance Traveled
+# Hard
+# https://leetcode.com/problems/minimum-total-distance-traveled
+
+=begin
+There are some robots and factories on the X-axis. You are given an integer array robot where robot[i] is the position of the ith robot. You are also given a 2D integer array factory where factory[j] = [positionj, limitj] indicates that positionj is the position of the jth factory and that the jth factory can repair at most limitj robots.
+The positions of each robot are unique. The positions of each factory are also unique. Note that a robot can be in the same position as a factory initially.
+All the robots are initially broken; they keep moving in one direction. The direction could be the negative or the positive direction of the X-axis. When a robot reaches a factory that did not reach its limit, the factory repairs the robot, and it stops moving.
+At any moment, you can set the initial direction of moving for some robot. Your target is to minimize the total distance traveled by all the robots.
+Return the minimum total distance traveled by all the robots. The test cases are generated such that all the robots can be repaired.
+
+Note that
+* All robots move at the same speed.
+* If two robots move in the same direction, they will never collide.
+* If two robots move in opposite directions and they meet at some point, they do not collide. They cross each other.
+* If a robot passes by a factory that reached its limits, it crosses it as if it does not exist.
+* If the robot moved from a position x to a position y, the distance it moved is |y - x|.
+
+Example 1:
+Input: robot = [0,4,6], factory = [[2,2],[6,2]]
+Output: 4
+Explanation: As shown in the figure:
+- The first robot at position 0 moves in the positive direction. It will be repaired at the first factory.
+- The second robot at position 4 moves in the negative direction. It will be repaired at the first factory.
+- The third robot at position 6 will be repaired at the second factory. It does not need to move.
+The limit of the first factory is 2, and it fixed 2 robots.
+The limit of the second factory is 2, and it fixed 1 robot.
+The total distance is |2 - 0| + |2 - 4| + |6 - 6| = 4. It can be shown that we cannot achieve a better total distance than 4.
+
+Example 2:
+Input: robot = [1,-1], factory = [[-2,1],[2,1]]
+Output: 2
+Explanation: As shown in the figure:
+- The first robot at position 1 moves in the positive direction. It will be repaired at the second factory.
+- The second robot at position -1 moves in the negative direction. It will be repaired at the first factory.
+The limit of the first factory is 1, and it fixed 1 robot.
+The limit of the second factory is 1, and it fixed 1 robot.
+The total distance is |2 - 1| + |(-2) - (-1)| = 2. It can be shown that we cannot achieve a better total distance than 2.
+
+Constraints:
+* 1 <= robot.length, factory.length <= 100
+* factory[j].length == 2
+* -109 <= robot[i], positionj <= 109
+* 0 <= limitj <= robot.length
+* The input will be generated such that it is always possible to repair every robot.
+=end
+
+# @param {Integer[]} robot
+# @param {Integer[][]} factory
+# @return {Integer}
+def minimum_total_distance(robot, factory)
+  robot.sort!
+  factory.sort!
+
+  m, n = robot.length, factory.length
+  dp = Array.new(m + 1) { Array.new(n + 1, 0) }
+  m.times { |i| dp[i][n] = Float::INFINITY }
+
+  (n - 1).downto(0) do |j|
+    prefix = 0
+    qq = [[m, 0]]
+
+    (m - 1).downto(0) do |i|
+      prefix += (robot[i] - factory[j][0]).abs
+
+      qq.shift if qq[0][0] > i + factory[j][1]
+
+      while !qq.empty? && qq[-1][1] >= dp[i][j + 1] - prefix
+        qq.pop
+      end
+
+      qq.push([i, dp[i][j + 1] - prefix])
+      dp[i][j] = qq[0][1] + prefix
+    end
+  end
+
+  dp[0][0]
+end
+
+# **************** #
+#       TEST       #
+# **************** #
+
+require "test/unit"
+class Test_minimum_total_distance < Test::Unit::TestCase
+  def test_
+    assert_equal 4, minimum_total_distance([0, 4, 6], [[2, 2], [6, 2]])
+    assert_equal 2, minimum_total_distance([1, -1], [[-2, 1], [2, 1]])
+  end
+end