C++ (코딩테스트) - 국영수(백준) : 정렬

문제

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

10825번: 국영수

 

내가 푼 코드

#include <algorithm>
#include <vector>
#include <iostream>
#include <string>
using namespace std;

struct student
{
    string name;
    int kor;
    int eng;
    int math;
};

bool compare(const student& a, const student& b)
{
    if (a.kor != b.kor)
        return a.kor > b.kor;
    if (a.eng != b.eng)
        return a.eng < b.eng;
    if (a.math != b.math)
        return a.math > b.math;
    return a.name < b.name;
}

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

    int N;
    vector<student> v;
    cin >> N;
    v.resize(N);
    for (int i = 0; i < N; i++)
    {
        student temp;
        cin >> temp.name >> temp.kor >> temp.eng >> temp.math;
        v[i] = temp;
    }
    sort(v.begin(), v.end(), compare);
    for (int i = 0; i < N; i++)
    {
        cout << v[i].name << '\n';
    }
    return 0;
}

 

마지막

cout << v[i].name << '\n'; 을 cout << v[i].name << endl; 하면 시간초과 나옴