[백준 1181번] 단어정렬

#include <bits/stdc++.h>

using namespace std;

vector<string> v;

bool compare(string front , string back)
{
    if(front.size() == back.size())
    {
        if( front.compare(back) ==-1) return front < back;
        else if (front.compare(back)) return front < back;
        else front > back;
        
    }else{
        return front.size() < back.size();
    }
}
int main(void)
{
    int N;
    cin >> N;
    for(int i = 0 ; i< N; i++)
    {
        string temp;
        cin >> temp;
        v.push_back(temp);
    }
    sort(v.begin(), v.end(), compare);
    v.erase(unique(v.begin(), v.end()), v.end());
    for(int i = 0 ; i< v.size(); i++)
    {
        cout << v[i] << endl;
    }
}

 

v.erase 유용했다.

---