Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- int main(){
- int n,i,mx=0,s=0,nmax=0;
- scanf("%d",&n);
- int ar[n];
- for(i=0;i<n;i++){
- scanf("%d",&ar[i]);
- s+=ar[i];
- if(ar[i]>mx) mx=ar[i];
- }
- int k[1001]={0};
- for(i=0;i<n;i++){
- int x;
- x=ar[i];
- k[x]++;
- }
- for(i=1;i<=mx;i++){
- //printf("%d=%d\n",i,k[i]);
- if(k[i]>nmax) nmax=k[i];
- }
- //printf("%d ",s);
- printf("%.1f\n",(float)s/n);//average
- for(i=0;i<n;i++){
- for(int j=0;j<n-i-1;j++){
- if(ar[j]>ar[j+1]){
- int x;
- x=ar[j];
- ar[j]=ar[j+1];
- ar[j+1]=x;
- }
- }
- }
- if(n%2==0) printf("%.1f\n",(float)(ar[n/2-1]+ar[n/2])/2);
- else printf("%.1f\n",(float)ar[n/2]);
- for(i=1000;i>=0;i--){
- if(k[i]==nmax){
- printf("%.1f",(float)i);
- break;
- }
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement