vector
#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <vector>
using namespace std;
int main()
{
vector<int> a(4, 3), b(3, 4);
if(a < b) puts("a < b");
return 0;
}
pair
#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <vector>
using namespace std;
int main()
{
pair<int, string> p;
p = make_pair(10, "dwz");
p = {20, "zdy"};
pair<int, pair<double, float>> p;
return 0;
}
string
#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <vector>
using namespace std;
int main()
{
string a = "dwz";
a += "ing";
a += 'd';
cout << a << endl;
cout << a.substr(2, 3) << endl;
cout << a.substr(2) << endl;
cout << a.substr(2, 100) << endl;
printf("%s\d", a.c_str());
return 0;
}
queue
priority_queeue<int, vector<int>, greater<int>> heap;
map
#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <map>
using namespace std;
int main()
{
map<string, int> a;
a["dwz"] = 100;
cout << a["dwz"] << endl;
return 0;
}