최댓값과 최솟값

// 문자열을 공백을 기준으로
    for(int i=0;i<s.size();i++){
        if(s[i]==' '){
            box.push_back(s.substr(start,i-start));
            start=i+1;
        }
    }
    box.push_back(s.substr(start,s.size()-start));

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

string solution(string s) {
    string answer = "";
    vector<int> box;
    int start=0;
    for(int i=0;i<s.size();i++){
        if(s[i]==' '){
            box.push_back(stoi(s.substr(start,i-start)));
            start=i+1;
        }
    }
    box.push_back(stoi(s.substr(start,s.size()-start)));
    // sort(box.begin(),box.end());
    // answer+=to_string(box[0]);
    // answer+=' ';
    // answer+=to_string(box[box.size()-1]);
    answer+=to_string(*min_element(box.begin(),box.end()));
    answer+=' ';
    answer+=to_string(*max_element(box.begin(),box.end()));
    return answer;
}