algorithm header Sort() use

Author: SeongHo5356

Algorithm_sort.cpp

@@ -0,0 +1,32 @@
+#include<iostream>
+#include<algorithm>
+
+using namespace std;
+
+class Student{
+public:
+	string name;
+	int score;
+	Student(string name, int score){
+		this -> name = name;
+		this -> score = score;
+	}
+	// 정렬 기준 '점수가 작은 순서'
+	bool operator <(Student &student){
+		return this -> score > student.score;
+	}
+};
+
+int main(void){
+	Student students[] = {
+		Student("JSH", 99),
+		Student("LHJ", 95),
+		Student("KMJ", 97),
+		Student("HMS", 91),
+		Student("OHJ", 93)
+	};
+	sort(students, students+5);
+	for(int i =0; i<5; i++){
+		cout << students[i].name << ' ';
+	}
+}

Algorithm_sort.exe

@@ -0,0 +1,23 @@
+#include<iostream>
+#include<vector>
+#include<algorithm>
+
+using namespace std;
+
+int main(void){
+	// pair를 통해서 int 와 string 을 묶어줌
+	vector<pair<int, string>> v;
+	v.push_back(pair<int, string>(90, "90 JSH"));
+	v.push_back(pair<int, string>(69, "69 HMS")); 
+	v.push_back(pair<int, string>(85, "85 SSH")); 
+	v.push_back(pair<int, string>(70, "70 KMJ")); 
+	v.push_back(pair<int, string>(75, "75 OHJ")); 	
+	
+	sort(v.begin(), v.end());
+	
+	for(int i =0; i <v.size(); i++){
+		cout << v[i].second << ' ' <<"\n";
+	}
+	
+	return 0;
+}

Algorithm_sort2.cpp

@@ -0,0 +1,33 @@
+#include<iostream>
+#include<vector>
+#include<algorithm>
+
+using namespace std;
+
+bool compare(pair<string,pair<int, int>> a,
+			pair<string,pair<int, int>> b){
+	if(a.second.first == b.second.first){
+		return a.second.second > b.second.second;
+	}	
+	else{
+		return a.second.first > b.second.first;
+	}
+}
+
+int main(void){
+	// 이중pair를 통해서 세 변수를 묶어줌
+	vector<pair<string,pair<int, int>>> v;
+	v.push_back(pair<string,pair<int, int>>("90 JSH", pair<int,int>(90, 19961222)));
+	v.push_back(pair<string,pair<int, int>>("69 HMS", pair<int,int>(69, 19931222))); 
+	v.push_back(pair<string,pair<int, int>>("85 SSH", pair<int,int>(85, 19971222))); 
+	v.push_back(pair<string,pair<int, int>>("70 KMJ", pair<int,int>(70, 19981222))); 
+	v.push_back(pair<string,pair<int, int>>("70 OHJ", pair<int,int>(70, 19991222))); 	
+	
+	sort(v.begin(), v.end(), compare);
+	
+	for(int i =0; i <v.size(); i++){
+		cout << v[i].first << ' ' <<"\n";
+	}
+	
+	return 0;
+}