基本思想:
无;
关键点:
无;
#include<iostream> #include<string> #include<vector> #include<set> #include<algorithm> using namespace std; int main() { int n; while (cin >> n) { vector<int>vec; int m; int max = 0; for (int i = 0; i < n; i++) { cin >> m; vec.push_back(m); if (m >= max) max = m; } sort(vec.begin(), vec.end()); vec.pop_back(); cout << max << endl; if (vec.size() == 0) cout << -1 << endl; else { for (int i = 0; i < vec.size(); i++) { if (i == 0) cout << vec[i]; else cout << " " << vec[i] << endl; } cout << endl; } } return 0; }