| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 68251 | 老师 | 寻找第二小的数 | C++ | Accepted | 100 | 0 MS | 252 KB | 510 | 2023-02-03 16:38:34 |
#include<bits/stdc++.h> using namespace std; int minNumInArray(int a[],int n){ int s=200; for(int i=1;i<=n;i++){ if(a[i]<s) s=a[i]; } return s; } int main(){ int t; cin>>t; while(t--){ int n,a[20]; cin>>n; for(int i=1;i<=n;i++) cin>>a[i]; int minNum=minNumInArray(a,n); int a1[20],a1s=0; for(int i=1;i<=n;i++) if(a[i]!=minNum) a1[++a1s]=a[i]; minNum=minNumInArray(a1,a1s); if(minNum==200) cout<<"NO"<<endl; else cout<<minNum<<endl; } return 0; }