[기본과정, 5단계]

1. Deque
(프로그램-1, Deque-1)

#include<iostream>
#include<deque>

using namespace std;
int main()
{
	int n,i,b;
	deque <int> a;
	
	cin>>n;
	for(i=1; i<=n; i++){
		cin >> b;
		a.push_front(b);
	}
	for(i=0; i<n; i++)cout << a[i] <<" ";
	
	return 0;
}




(프로그램-2, Deque-2)

#include<iostream>
#include<deque>

using namespace std;
int main()
{
	int n,i,b;
	deque <int> a;
	deque <int>::iterator ii;
	
	cin>>n;
	for(i=1; i<=n; i++){
		cin >> b;
		for(ii=a.begin(); ii!=a.end(); ++ii){
			if(*ii < b) break;
		}
		a.insert(ii,b);
	}
	for(ii=a.begin(); ii!=a.end(); ++ii)
		cout << *ii << " ";
	cout << endl;
	
	return 0;
}






2. MAP
(프로그램-1, multimap-1)

#include<iostream>
#include<map>

using namespace std;
int main()
{
	int j;
	multimap<int, int> m;
	multimap<int, int>::iterator i;
	
	m.insert(pair<int,int>(7,10));
	m.insert(pair<int,int>(1,50));
	m.insert(pair<int,int>(4,60));
	m.insert(pair<int,int>(3,70));
	m.insert(pair<int,int>(7,89));
	
	for(i=m.begin(); i != m.end(); ++i){
		cout << (*i).first << " "<<(*i).second << endl;
	}
	cout << endl;
	
	return 0;
}



(프로그램-2, multimap-2)

#include<iostream>
#include<map>
using namespace std;
struct data{
	int n;
	char b[15];
	int k, e, m, s;
	double mm;
};
int main()
{
	struct data d[1004];
	int n,p,j;
	multimap<string, int> m;
	multimap<string, int>::iterator i;
	
	cin >> n;
	for(p=1; p<=n; p++){
		cin >> d[p].n >> d[p].b;
		cin >> d[p].k >> d[p].e >> d[p].m;
		m.insert(pair<string,int>(d[p].b, p));
	}
	
	for(i=m.begin(); i != m.end(); ++i){
		j = i->second;
		cout << d[j].n <<" "<<d[j].b << " ";
		cout << d[j].k <<" "<<d[j].e << " "<< d[j].m <<" ";
		cout << endl;
	}
	cout << endl;
	
	return 0;
}






3. LIST
(프로그램-1, list-1)

#include <iostream>
#include <stdio.h>
#include <list>
using namespace std;

int main()
{
    list <int> t;

    t.push_back(10);

    list <int> :: iterator i;
    for(i=t.begin(); i !=t.end(); ++i) printf("%d ",*i);
    printf("\n");

    return 0;
} 



(프로그램-2, list-2)
- list에서 삭제

#include <iostream>
#include <stdio.h>
#include <list>
using namespace std;

int main()
{
    int j;
    list <int> tt;
    list <int>::iterator ii;
    list <int>::iterator jj=tt.begin();

    tt.push_back(10);
    tt.push_back(20);
    tt.push_front(30);
    tt.push_front(40);
    tt.push_front(50);
    tt.push_front(45);

    for(ii=tt.begin(); ii !=tt.end(); ii++) printf("%d ",*ii);
    printf("\n");

    for(j=1; j<=2; j++) ++jj; ii=tt.erase(jj);

    for(ii=tt.begin(); ii !=tt.end(); ii++) printf("%d ",*ii);
    printf("\n");

    return 0;
} 



(프로그램-3, list-3)
- list 중간 삭제 후 삽입(대체)

#include <iostream>
#include <stdio.h>
#include <list>
using namespace std;
int main()
{    
    list <int> tt;
    list <int>::iterator ii;
    list <int>::iterator jj=tt.begin();

    tt.push_back(10);    tt.push_back(20);    tt.push_front(30);   
    tt.push_front(40);   tt.push_front(50);   tt.push_front(45);
    
    int j;
    for(j=1; j<=2; j++) ++jj; ii=tt.erase(jj);
    jj=ii; ii=tt.insert(jj,60);

    for(ii=tt.begin(); ii !=tt.end(); ii++) printf("%d ",*ii);printf("\n");

    return 0;
}



(프로그램-4, list-4)
- list 일괄삭제

#include <iostream>
#include <stdio.h>
#include <list>
using namespace std;
int main()
{
    list <int> tt;
    list <int>::iterator ii;
    list <int>::iterator jj=tt.begin();

    tt.push_back(10);    tt.push_back(20);    tt.push_front(30);
    tt.push_front(40);   tt.push_front(10);   tt.push_front(10);
/*
    int j;
    for(j=1; j<=2; j++) ++jj; ii=tt.erase(jj);
    jj=ii; ii=tt.insert(jj,60);
*/
    for(ii=tt.begin(); ii !=tt.end(); ii++) printf("%d ",*ii);printf("\n");

    tt.remove(10);
    for(ii=tt.begin(); ii !=tt.end(); ii++) printf("%d ",*ii);printf("\n");

    return 0;
} 



(프로그램-5, list-5)
- 조건 삭제

#include <iostream>
#include <stdio.h>
#include <list>
using namespace std;
bool p(int n){return n>=20 && n<=50;}
int main()
{
    list <int> tt;
    list <int>::iterator ii;
    list <int>::iterator jj=tt.begin();

    tt.push_back(10);    tt.push_back(20);    tt.push_front(30);
    tt.push_front(70);   tt.push_front(10);   tt.push_front(10);
/*
    int j;
    for(j=1; j<=2; j++) ++jj; ii=tt.erase(jj);
    jj=ii; ii=tt.insert(jj,60);
*/
    for(ii=tt.begin(); ii !=tt.end(); ii++) printf("%d ",*ii);printf("\n");

    tt.remove_if(p);
    for(ii=tt.begin(); ii !=tt.end(); ii++) printf("%d ",*ii);printf("\n");

    return 0;
} 



(프로그램-6, list-6)
- list sort

#include <iostream>
#include <stdio.h>
#include <list>
using namespace std;
bool p(int n){return n>=20 && n<=50;}
int main()
{
    list <int> tt;
    list <int>::iterator ii;
    list <int>::iterator jj=tt.begin();

    tt.push_back(10);    tt.push_back(20);    tt.push_front(30);
    tt.push_front(70);   tt.push_front(10);   tt.push_front(10);

    int j;
    for(j=1; j<=3; j++) ++jj; ii=tt.erase(jj);
    jj=ii; ii=tt.insert(jj,60);

    tt.sort();
    for(ii=tt.begin(); ii !=tt.end(); ii++) printf("%d ",*ii);printf("\n");

    return 0;
}