1894. Find the Student that Will Replace the Chalk

class Solution {
public:
    int chalkReplacer(vector<int>& chalk, int k) 
    {
        if(chalk.size()==1)  return 0;
        if(chalk[0]>k)  return 0;
        int i=0;
        long long sum=0;

        for(int i=0; i<chalk.size(); i++)
        {
            sum += chalk[i];
        }
        k = k%sum;

        while(true)
        {

            if(k<chalk[i])
                return i;
                        
            k = k - chalk[i]; 
            i++;


            if(i>chalk.size()-1)
                i=0;
        } 

        return -1; 
    }
};