Minimum days to make Array elements with value at least K sum at least X

import java.io.*;class GFG{     static void findMinDays(int arr[], int R[], int N,                        int X, int K){                 int low = 0, high = X;    int minDays = -1;        while (low = K)            {                                                sum += temp;            }        }                        if (sum >= X)        {                                     minDays = mid;            high = mid – 1;        }                else        {            low = mid + 1;        }    }            System.out.println(minDays);}public static void main(String[] args){    int X = 100, K = 45;    int arr[] = { 2, 5, 2, 6 };    int R[] = { 10, 13, 15, 12 };    int N = arr.length;         findMinDays(arr, R, N, X, K);}}