最长最短单词

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

vector <char> s3,s1,s2;
int maxn=0,minn=5000;

void cmp(int l,int &ma,int &mi){
    if(l<mi){
        mi=l;s2.clear() ;
        for(vector<char>::iterator it =s3.begin();it!=s3.end();it++){
            s2.push_back(*it); 
        }
    }
    if(l>ma){
        ma=l;s1.clear() ;
        for(vector<char>::iterator it =s3.begin();it!=s3.end();it++){
            s1.push_back(*it); 
        }
    }
    
}
void remake(string s){
    int flag=0;
    for(int i=0;i<s.size();i++){
        if(s[i]!=‘,‘&&s[i]!=‘ ‘){
            s3.push_back(s[i]); flag=1;
        }else{
            if(flag)cmp(s3.size(),maxn,minn);
            s3.clear() ;flag=0;
        }
    }
    if(!s3.empty())    cmp(s3.size(),maxn,minn);
}
int main(){
    string s;
    getline(cin,s);
    remake(s);
    for(vector<char>::iterator it =s1.begin();it!=s1.end();it++){
            cout<<*it;
        }
    cout<<endl;
    for(vector<char>::iterator it =s2.begin();it!=s2.end();it++){
            cout<<*it;
        }
    
}