Merge K sorted list

#include
#include
#include

using namespace std;

class Vector {
listl1;
listl2;
public:
Vector(listx, listy){
l1 = x;
l2 = y;
}
void sort(){
l1.sort();
l2.sort();
}
void print(){
for(int t : l1){
cout<<t<<" ";
}
}
void merge(){
l1.merge(l2);
cout<<l1;
}
};

int main() {
listar1; listar2;
cin>>ar1>>ar2;
Vector(ar1,ar2);
return 0;
}

Where am I missing?? Plz help soon

Hello @afzal442 please share your code by saving it on ide.codingblocks.com because just pasting your code here will miss certain characters and then we have to first check them so it will be better if you can share by saving .

@afzal442 i have gone through your code:
firstly you are not taking the input in the correct manner:
secodly your logic is wrong.
if we coulf have use sort directly in it then what is the need of this question we have to use the logic.

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.