Advertisement
Guest User

Untitled

a guest
Oct 21st, 2019
122
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.97 KB | None | 0 0
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. int main(){
  4. int n,i,mx=0,s=0,nmax=0;
  5. scanf("%d",&n);
  6. int ar[n];
  7. for(i=0;i<n;i++){
  8. scanf("%d",&ar[i]);
  9. s+=ar[i];
  10. if(ar[i]>mx) mx=ar[i];
  11. }
  12. int k[1001]={0};
  13. for(i=0;i<n;i++){
  14. int x;
  15. x=ar[i];
  16. k[x]++;
  17. }
  18. for(i=1;i<=mx;i++){
  19. //printf("%d=%d\n",i,k[i]);
  20. if(k[i]>nmax) nmax=k[i];
  21. }
  22. //printf("%d ",s);
  23. printf("%.1f\n",(float)s/n);//average
  24. for(i=0;i<n;i++){
  25. for(int j=0;j<n-i-1;j++){
  26. if(ar[j]>ar[j+1]){
  27. int x;
  28. x=ar[j];
  29. ar[j]=ar[j+1];
  30. ar[j+1]=x;
  31. }
  32. }
  33. }
  34.  
  35. if(n%2==0) printf("%.1f\n",(float)(ar[n/2-1]+ar[n/2])/2);
  36. else printf("%.1f\n",(float)ar[n/2]);
  37.  
  38. for(i=1000;i>=0;i--){
  39. if(k[i]==nmax){
  40. printf("%.1f",(float)i);
  41. break;
  42. }
  43. }
  44. return 0;
  45. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement