알... 알면 편리하지 않을까요옷! 럭키이!~

#include <bits/stdc++.h>
using namespace std;
struct LUCKY {
 int a, b;
 string s;
};
int main() {
 {
 int a = 2, b = 1, c = 6, d = 4;
 printf("%d %d\n", min({ a,b,c,d }), max({ a,b,c,d }));
 int p[] = { 5,3,2,4 };
 printf("%d %d\n", *min_element(p, p + 4), *max_element(p, p + 4));
 vector <int> v = { 5,3,2,4 };
 printf("%d %d\n", *min_element(v.begin(), v.end()), *max_element(v.begin(), v.end()));
 } {
 puts("");
 LUCKY a = { 1, 10, "123" };
 cout << a.a << "\n" << a.b << "\n" << a.s << "\n\n";
 LUCKY b = { 5, 5, "321" };
 LUCKY c = { 3, 20, "1234" };
 vector <LUCKY> v = { a,b,c };
 sort(v.begin(), v.end(), [&](LUCKY &p, LUCKY &q) {
 return p.a < q.a;
 });
 for (auto &x : v) cout << x.a << " " << x.b << " " << x.s << "\n";
 double pi = 3.141592;
 string s = to_string(pi);
 cout << "\n" << s << "\n";
 } {
 puts("");
 map <string, int> A; //unordered_map보다 느리지만 key가 정렬됨
 unordered_map <string, int> B; //map보다 빠르지만 key가 정렬되지 않음
 A["cba"] = B["cba"] = 1;
 A["pqr"] = B["pqr"] = 2;
 A["abcd"] = B["abcd"] = 3;
 for (auto &x : A) printf("%s : %d\n", x.first.c_str(), x.second);
 puts("");
 for (auto &x : B) printf("%s : %d\n", x.first.c_str(), x.second);
 }
}