C++ 找出字典序最小的字符串

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

using namespace std;

bool compare(const string& s1, const string& s2) {
    return s1 < s2;
}

int main() {
    int N;
    cin >> N;
    
    vector<string> strings;
    for (int i = 0; i < N; i++) {
        string s;
        cin >> s;
        strings.push_back(s);
    }
    
    sort(strings.begin(), strings.end(), compare);
    
    cout << strings[0] << endl;
    
    return 0;
}