一本通No.1143

不要脸的蒟蒻的代码：

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

string w[200];
string s;
int i=0,maxl=0,minl=101;

int main(){
	while(cin>>w[i]){
		if(w[i].find(",")!=-1){
			s=w[i].substr(0,w[i].find(","));
			i++;
			w[i]=w[i-1].substr(w[i-1].find(",")+1,w[i].length()-w[i-1].find(",")-1);
			w[i-1]=s;
			maxl=max((int)w[i-1].length(),maxl);
			maxl=max((int)w[i].length(),maxl);
			minl=min((int)w[i-1].length(),minl);
			minl=min((int)w[i].length(),minl);
			i++;
			continue;
		}
		maxl=max((int)w[i].length(),maxl);
		minl=min((int)w[i].length(),minl);
		i++;
	}
	i--;
	cout<<endl;
	for(int k=0;k<=i;k++){
		if(maxl==w[k].length()){
			cout<<w[k]<<endl;
			break;
		}
	}
	for(int k=0;k<=i;k++){
		if(minl==w[k].length()){
			cout<<w[k];
			break;
		}
	}

	return 0;
}