Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
union of two sorted array
#include <bits/stdc++.h> using namespace std; int main() { //code int t; cin>>t; while(t--) { int n1,n2; cin>>n1>>n2; vector<int>v1(n1),v2(n2); for(int i=0;i<n1;i++) cin>>v1[i]; for(int i=0;i<n2;i++) cin>>v2[i]; unordered_set<int>m; for(int i=0;i<n1;i++) { m.insert(v1[i]); } for(int i=0;i<n2;i++) { m.insert(v2[i]); } cout<<(int)m.size()<<endl; } return 0; }
run
|
edit
|
history
|
help
0
Boost phoenix. e.g 2: functor
queue-with-fixed-size
Hash(Prototipo)
Const Return Test
Stream5
Updated Linked Lists - 5/10/2017 V4.0
simple use of templete
Working variables benchmark
Rezolvare Ex 4
RCP 27