Use ranges::sort for sorting vector

Author: yanglbme

solution/0300-0399/0368.Largest Divisible Subset/Solution.cpp

@@ -1,7 +1,7 @@
 class Solution {
 public:
     vector<int> largestDivisibleSubset(vector<int>& nums) {
-        sort(nums.begin(), nums.end());
+        ranges::sort(nums);
         int n = nums.size();
         int f[n];
         int k = 0;