33 lines
737 B
C++
33 lines
737 B
C++
// ac_8_25.cpp
|
|
// Горбацевич Андрей
|
|
#include <iostream>
|
|
#include <vector>
|
|
#include <algorithm>
|
|
#include <ctime>
|
|
using namespace std;
|
|
|
|
vector<int> max_diff(const vector<int> &vec) {
|
|
vector<int> v = vec;
|
|
sort(begin(v), end(v));
|
|
swap(*(v.end() - 1), v[1]);
|
|
v.resize(2);
|
|
return v;
|
|
}
|
|
|
|
int main() {
|
|
int N;
|
|
cout << "N >>>";
|
|
cin >> N;
|
|
vector<int> v;
|
|
v.reserve(N);
|
|
srand(time(0));
|
|
for (int i = 0; i < N; i++) {
|
|
int j = -5 + rand() % 10;
|
|
cout << j << " ";
|
|
v.push_back(j);
|
|
}
|
|
cout << endl;
|
|
vector<int> nv = max_diff(v);
|
|
cout << "Biggest diff is between " << nv[0] << " and " << nv[1] << " (eq. " << nv[0] - nv[1] << ")" << endl;
|
|
return 0;
|
|
}
|