Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- //16 алгоритм
- /*
- 8 7
- 1 -3 5.3 3.8 -2.8 8 0 4
- -3.6 1 -500 8 2 -.7 8
- */
- #include <iostream>
- #include <vector>
- #include <algorithm>
- using namespace std;
- int main()
- {
- int n,m;
- cin>>n>>m;
- vector <double> v1(n),v2(m),v3(n+m);
- for (int i=0; i<n; i++)
- cin>>v1[i];
- for (int i=0;i<m;++i)
- cin>>v2[i];
- int
- it = (copy_if (v1.begin(), v1.end(), v3.begin(),
- [](double a){return !(a<0);}) - v3.begin());
- for (int i=0; i<v3.size(); i++){
- cout<<v3[i]<<' ';
- }
- cout<<'\n';
- it = (copy_if (v2.begin(), v2.end(), v3.begin()+it,
- [](double a){return !(a<0);}) -v3.begin());
- for (int i=0; i<v3.size(); i++){
- cout<<v3[i]<<' ';
- }
- cout<<'\n';
- int mx=(max_element(v3.begin(),v3.end())-v3.begin());
- int k=count(v3.begin(),v3.end(),v3[mx]);
- if (k!=1){
- remove(v3.begin()+mx+1,v3.end(),v3[mx]);
- }
- v3.resize(it-k+1);
- for (int i=0; i<v3.size(); i++){
- cout<<v3[i]<<' ';
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement