6133. Maximum number of packets

6133. Maximum number of groups

You are given an array grades of positive integers representing the grades of some students in the college.You intend to divide all students into ordered non-empty groups where the order between groups satisfies all of the following conditions:

The total grade of students in group i is less than the total grade of students in group (i + 1), true for all groups (except the last group).The total number of students in the ith group is less than the total number of students in the (i + 1)th group, true for all groups (except the last).

Returns the maximum number of groups that can be formed.

Example 1:

Input: grades = [10,6,12,7,3,5]
Output: 3
Explanation: Here is one possible way to form 3 groups:

• Students in group 1 have grades = [12] , total grade: 12 , number of students: 1
• Students in group 2 have grades = [6,7] , total grade: 6 + 7 = 13 , number of students: 2
• Students in group 3 have grades = [10,3,5] , total grade: 10 + 3 + 5 = 18 , number of students: 3
  It can be shown that no more than 3 groups can be formed.

Example 2:

Input: grades = [8,8]
Output: 1
Explanation: Only 1 group can be formed, because if two groups are to be formed, the number of students in each group will be equal.

This question seems difficult, but it is actually confusing. The code to solve the problem is as follows:

int maximumGroups(int* grades, int gradesSize){for(int i=1;i<1000;i++){int a=(i+1)*i/2;if(a>gradesSize){return i-1;}}return 0;}