http://acm.hdu.edu.cn/showproblem.php?pid=1238
找到最短的字符串,暴力搜索,STL轻松水过
#include<iostream>
#include<string>
#include<algorithm>
#include<cstdio>
using namespace std;
int main()
{
int t,n,i,j;
scanf("%d",&t);
while(t--)
{
string s[101];
scanf("%d",&n);
int len=1000,j=0,max,f=0;
for(i=0;i<n;++i)
{
cin>>s[i];
if(s[i].size()<len)
{
len=s[i].size();
j=i;