Information
- ID
- 1832
- Time
- 1000ms
- Memory
- 512MiB
- Difficulty
- 4
- Tags
- # Submissions
- 43
- Accepted
- 20
- Uploaded By
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 1e5+10;
int a[N],sum;
int main()
{
int n;cin>>n;
int maxx = -10001,minn = 10001;
for(int i = 1;i <= n;i++)
{
cin>>a[i];
}
for(int i = 1;i <= n;i++)
{
sum += a[i];
maxx = max(maxx,a[i]);
minn = min(minn,a[i]);
}
cout<<maxx<<"\n"<<minn<<"\n"<< sum<<"\n";
return 0;
}
By signing up a 追梦算法网 universal account, you can submit code and join discussions in all online judging services provided by us.