蓝桥杯算法提高VIP-第二大整数-题解(C++代码)
```cpp#includeusingnamespacestd;voidadjust(int*a,inti,intlen){intleft=2*i+1;intright=2*i+2;intmax=i;if(lefta[max]){max=left;}if(righta[max]){max=right;
Hifipsysta-1932-蓝桥杯算法提高VIP-第二大整数（C++代码）
```cpp#include#include#includeusingnamespacestd;intmain(){inttmp;vectormyvect;while(cin>>tmp&&tmp!=0){myvect.push_back(tmp);}sort(myvect.begin(),
蓝桥杯算法提高VIP-第二大整数
摘要：解题思路:注意事项:参考代码:#include<bits/stdc++.h>using namespace std;set<int> st;int main() { int num; wh……
蓝桥杯算法提高VIP-第二大整数-题解(C++代码) by Zfans.
```cpp#include#includeusingnamespacestd;intmain(){intarr[21];intnum;inti=0;while(cin>>num&&num!=0)arr[i++]=num;sort(arr,arr+i);cout
蓝桥杯算法提高VIP-第二大整数-STL超简单解法
**set默认升序排序，所以可以用set做**```cpp#include#include#includeusingnamespacestd;setst;intmain(){intnum;while(scanf("%d",&num),num)st.insert(num);printf("%d\n",