蓝桥杯算法提高 第二大整数

#include <cmath>#include <cstdio>#include <algorithm> #include <iostream>using namespace std;int a[25];int main(){int i=0;while(true){int tmp;scanf("%d",&tmp);if(tmp==0)break;a[i++]=tmp;}sort(a,a+i);cout<<a[i-2]<<endl;return 0;}