最后一个TLE了怎么办

#include<bits/stdc++.h>
using namespace std;
int a[100000],maxn=-200000,minn=200000,s1=-10,s2;
int main(){
	int n,m;
	scanf("%d%d",&m,&n);
	sort(a+1,a+1+m);
	if(m<n) n=m;
	for(int i=1;i<=n;i++){
		scanf("%d",&a[i]);
		if(a[i]>maxn) maxn=a[i];
		if(a[i]<minn) minn=a[i];
	} 
	for(int i=minn;i<=maxn;i++){
		int temp=0;
		for(int j=1;j<=n;j++){
			if(a[j]>=i) temp+=i;
		}
		if(temp>s1) {
			s1=temp;
			s2=i;
		}
	}
	printf("%d %d",s2,s1);
	return 0;
}