Binary Search, C++
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n    int kIncreasing(vector<int>& arr, int k) {\n        int n = arr.size();\n        int a = 0;\n        for (int j = 0; j < k; j++) {\n            vector<int> v;\n            for (int i = j; i < n; i += k) {\n                auto f = upper_bound(v.begin(), v.end(), arr[i]);\n                if (f == v.end()) {\n                    v.push_back(arr[i]);\n                } else {\n                    *f = arr[i];\n                }\n            }\n            a += v.size();\n        }\n        return arr.size() - a;\n    }\n};\n```
['C++']