LIS of K arrays
\nimport bisect\n\nclass Solution:\n    def kIncreasing(self, arr: List[int], k: int) -> int:\n        n = len(arr)\n        lis = [[] for _ in range(k)]\n     
```\nimport bisect\n\nclass Solution:\n    def kIncreasing(self, arr: List[int], k: int) -> int:\n        n = len(arr)\n        lis = [[] for _ in range(k)]\n        res = n\n        for i in range(n):\n            x = bisect.bisect_left(lis[i % k], (arr[i], i))\n            if x < len(lis[i % k]):\n                lis[i % k][x] = (arr[i], i)\n            else:\n                lis[i % k].append((arr[i], i))\n                res -= 1\n \xA0 \xA0 \xA0 \xA0return res \n```
[]