Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <vector>
- #include <algorithm>
- int main()
- {
- using namespace std;
- int n;
- cout << "enter n:" << endl;
- cin >> n;
- int imin, imax;
- vector <double> v(n);
- for (int i = 0; i < v.size(); i++)
- {
- cin >> v[i];
- }
- double min = v[0];
- double max = v[0];
- for (int i = 0; i < v.size(); i++)
- {
- if (v[i] < min)
- {
- min = v[i];
- imin = i;
- }
- if (fabs(v[i]) > max)
- {
- max = v[i];
- imax = i;
- }
- }
- int t;
- if (imin > imax)
- {
- t = imin;
- imin = imax;
- imax = t;
- }
- if (imin == imax)
- {
- cout << "(mas was not changed)" << endl;
- for (int i = 0; i < v.size(); i++)
- {
- cout << v[i] << " ";
- }
- }
- else
- {
- sort(v.begin() + imin + 1, v.end() - (v.size() - imax), greater<double>());
- cout << "new: " << endl;
- for (int i = 0; i < v.size(); i++)
- {
- cout << v[i] << " ";
- }
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement