*6-3 save small experts

Title Description

Source code

#include<iostream>
#include<algorithm>

using namespace std;

const int N = 100000;
int a[N + 1];
int b[N + 1];
bool cmp(int a, int b)
{
    
	return a > b;
	
}
int main()
{
    
	int n, m,t=0,d,i,j;
	cin >> n >> m;
	int count = 0;
	int x;
	for ( i = 0; i < n; i++)
	{
    
		cin >> a[i];
	}
	while (1)
	{
    
		for (j = 2; j <= a[n - 1]; j++)
		{
    
			t = 0;
			for (i = 0; i < n; i++)
			{
    
				t += a[i] / j;
				if (t == m) 
				{
    
					b[i] = j;
					break;
				}
			}
		}
		sort(b, b + N + 1, cmp);
		cout << b[0] << endl;
		break;
		
	}
	
	return 0;
}

About this problem

This is used here. sort To help us sort
If the number of pieces meets the requirements We'll save it b In the array Reuse sort Sort in descending order Find the longest length
（ This question given by the teacher There is no place to test the code The two cases given in the title can be passed ）