Python的哦~

x=input().split()
e=len(x)
a=int(x[0])
for i in range(1,len(x)):
    b=int(x[i])
    if b>a:
        a=b
print(e,a)

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

int a[105];
int main()
{
  int x;
  int t=0;
  while(cin>>x&&getchar()!='\n')
    {
        a[t++]=x;
    }
  sort(a,a+t);
  cout<<t<<" " <<a[t-1];
  return 0;
}

#include <iostream>

using namespace std; int a[110],n=1; int main() { while (cin>>a[n]){ n++; } n--; for (int i=2;i<=n;i++){ if(a[1]<a[i]){ swap(a[1],a[i]); } }

cout<<n<<" "<<a[1]; return 0；

}

a=list(map(int,input().split()))

n=len(a)

maxt=a[0]

for i in range(1,n):

if a[i]>maxt:

maxt=a[i]

print("%d %d "%(n,maxt))