C++求最小余数：高效算法实现

#include \n#include \n\nint main() {\n int n;\n std::cin >> n;\n\n int min_z = INT_MAX;\n\n for (int i = 0; i < n; i++) {\n int x, y;\n std::cin >> x >> y;\n int z = x % y;\n if (z < min_z) {\n min_z = z;\n }\n }\n\n std::cout << min_z << std::endl;\n\n return 0;\n}