백준 알고리즘 문제로 C++ 기초 학습 - 정렬 2

https://www.acmicpc.net/problem/10814

• stable_sort(): 동일한 값이 있을 경우 입력 순서를 보존하여 정렬

#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

bool Comp(pair<int, string> p1, pair<int, string> p2)
{
    return p1.first < p2.first;
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(NULL);

    int n;
    int age;
    string name;
    cin >> n;

    vector<pair<int, string>> user;

    for (int i = 0; i < n; i++)
    {
        cin >> age >> name;
        user.push_back({ age, name });
    }

    stable_sort(user.begin(), user.end(), Comp);

    for (int i = 0; i < n; i++)
    {
        cout << user[i].first << ' ' << user[i].second << '\n';
    }
}

---

https://www.acmicpc.net/problem/11931

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);

	int n;
	int num;
	vector<int> v;

	cin >> n;

	for (int i = 0; i < n; i++)
	{
		cin >> num;
		v.push_back(num);
	}

	sort(v.begin(), v.end(), greater<int>());

	for (int i = 0; i < v.size(); i++)
	{
		cout << v[i] << '\n';
	}

}

---

https://www.acmicpc.net/problem/2822

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);

    int score;
    int sum = 0;
    vector<pair<int, int>> v;
    vector<int> idx;

    for (int i = 0; i < 8; i++)
    {
        cin >> score;
        v.push_back({ score, i + 1 });
    }

    sort(v.begin(), v.end(), greater<pair<int,int>>());

    for (int i = 0; i < 5; i++)
    {
        sum += v[i].first;
        idx.push_back(v[i].second);
    }

    cout << sum << '\n';

    sort(idx.begin(), idx.end());

    for (int i = 0; i < 5; i++)
    {
        cout << idx[i] << ' ';
    }
}