Reja: Assotsiativ konteynerlar haqida

Ro’yxat berilgan ekrandan kirtilgan sondan
qiymati katta elementlarni toping.

#include #include using namespace std; int main() { list sample1; int n,a; cin>>n; for(int i=0;i { a=rand()%100; sample1.push_back(a);} for (auto it = sample1.begin(); it != sample1.end(); ++it) { cout << *it << " ";} int k; cout<<"son kiriting ";cin>>k; int max=sample1.front(); for (auto it = sample1.begin(); it != sample1.end(); ++it) { if(*it >k ) cout << *it << " ";} return 0; }

LABORATORIYA SAVOLI?

VECTOR hosil qiling elementlarini o’sish
tartibida saralang
#include
#include
#include
using namespace std;
int main()
{ vector v;
int n,a; cin>>n;
for(int i=0;i{ a=rand()%100;
v.push_back(a);
cout<} cout<for(int i=0;i{ for(int j=0;j{ if(v.at(i)swap(v.at(i),v.at(j));}
}} for(int i=0;icout<return 0;
}

LABORATORIYA SAVOLI?

Navbatni toq elementlari o‘chirilsin.
#include
#include
using namespace std;
int main()
{
deque mydeque={ 1, 2, 3, 4,5,3,7,3,12,4,8};
for (auto it = mydeque.begin(); it != mydeque.end(); ++it)
cout << ' ' << *it;
cout<for (auto it = mydeque.begin(); it != mydeque.end(); ++it)
{if(*it%2==1){
mydeque.erase(it); }}
for (auto it = mydeque.begin(); it != mydeque.end(); ++it)
cout << ' ' << *it;
return 0;
}