把每天骑行距离递减排序成数组a,比较a[i]和i的大小即可
#include <cstdio>
#include <algorithm>
using namespace std;
const int maxn = 100001;
int distanceRecord[maxn] = {0}, dNum = 1;
bool cmp(int a, int b){
return a > b;
}
int main(){
int n;
scanf("%d", &n);
while(n--) scanf("%d", distanceRecord + (dNum++));
sort(distanceRecord + 1, distanceRecord + dNum, cmp);
int maxE = 0;
for(int i = 1 ; i < dNum; i++){
if(distanceRecord[i] > i) maxE = i;
}
printf("%d", maxE);
return 0;
}