Run ID | 作者 | 问题 | 语言 | 测评结果 | Time | Memory | 代码长度 | 提交时间 |
---|---|---|---|---|---|---|---|---|
86640 | 吴梓玄 | 寻找第二小的数 | C++ | Accepted | 1 MS | 272 KB | 880 | 2024-07-27 09:27:40 |
#include <iostream> using namespace std; int shuzu[10]; void panduan(); int main() { panduan(); return 0; } void panduan() { int i=0, j=0, k=0, n=0; int min, secondmin; cin >> n; for (i = 0; i < n; i++) { secondmin = 101; min = 101; cin >> j; for (k = 0; k < j; k++) { cin >> shuzu[k]; } min = shuzu[0]; for (k = 1; k < j; k++) { if (shuzu[k] < min) { secondmin = min; min = shuzu[k]; } else if (shuzu[k]<secondmin && shuzu[k]!=min) { secondmin = shuzu[k]; } } if (secondmin == 101 or secondmin==min) { cout << "NO"<<endl; } else { cout << secondmin<<endl; } } return; }