fork(2) download
copy 
  1. #include <iostream>
  2. #include <algorithm>
  3. using namespace std;
  4.  
  5. void eval1(int *arr, int n)
  6. {
  7. 	long long rev = 0LL;
  8. 	for(int b=0;b<n;b++)
  9.     {
  10.             int pos=b;
  11.             for(int c=pos;c<n;c++)
  12.             {
  13.                     if(arr[pos]>arr[c])
  14.                         rev+=(long long)(arr[pos]-arr[c]);
  15.                     else
  16.                         rev+=(long long)(arr[c]-arr[pos]);
  17.             }
  18.     }
  19.     cout << rev << endl;
  20. }
  21.  
  22.  
  23. void eval2(int *arr, int n)
  24. {
  25. 	long long rev = 0LL;
  26. 	sort(arr, arr + n);
  27. 	for(int b=0;b<n;b++)
  28. 	{
  29. 	   rev += (2 * b - n + 1) * arr[b];
  30. 	}
  31.     cout<<rev;
  32. }
  33.  
  34.  
  35. int main() {
  36. 	int arr[] = {23, 43, 56, 76, 12, 43, 67, 2, 567, 43, 23};
  37. 	const int size = static_cast<int>(sizeof arr / sizeof arr[0]);
  38. 	eval1(arr, size);
  39. 	eval2(arr, size);
  40. 	return 0;
  41. }
Success #stdin #stdout 0s 3296KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
6558
6558
https://ideone.com/QLzJSa
language:
C++ (gcc 8.3)
created:
9 years ago
visibility:
secret

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!