백준 8979 : 올림픽

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

8979번: 올림픽

 

#include <iostream>
#include <algorithm>
 
struct country
{
    int gold;
    int silver;
    int copper;
    int number;
}countrys[1010];
 
int N, K;
 
bool cmp(country& first, country& second)
{
    if (first.gold == second.gold)
    {
        if (first.silver == second.silver)
        {
            return first.copper > second.copper;
        }
        else
        {
            return first.silver > second.silver;
        }
    }
    else
    {
        return first.gold > second.gold;
    }
}
 
void input()
{
    int nation;
    std::cin >> N >> K;
    for (int i = 1; i <= N; ++i)
    {
        std::cin >> countrys[i].number >> countrys[i].gold >> countrys[i].silver >> countrys[i].copper;
    }
}
 
void solve()
{
    std::sort(countrys + 1, countrys + N + 1, cmp);
    for (int i = 1; i <= N; ++i)
    {
        //std::cout << countrys[i].number << ' ' << countrys[i].gold << ' ' << countrys[i].silver << ' ' << countrys[i].copper << '\n';
        if (countrys[i].number == K)
        {
            int ans = i;
            while (countrys[ans].gold == countrys[ans - 1].gold &&
                countrys[ans].silver == countrys[ans - 1].silver &&
                countrys[ans].copper == countrys[ans - 1].copper)
            {
                --ans;
            }
            std::cout << ans;
            break;
        }
    }
}
 
int main()
{
    input();
    solve();
    return 0;
}

 

정렬을 열심히 배웁시다 정렬은 나의 원수

 

strick week ordering에 주의합시다