fork download
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define int long long int
  4. #define double long double
  5. #define print(a) for(auto x : a) cout << x << " "; cout << endl
  6.  
  7.  
  8. const int M = 1000000007;
  9. const int N = 3e5+9;
  10. const int INF = 2e9+1;
  11. const int LINF = 2000000000000000001;
  12.  
  13. inline int power(int a, int b) {
  14. int x = 1;
  15. a %= M;
  16. while (b) {
  17. if (b & 1) x = (x * a) % M;
  18. a = (a * a) % M;
  19. b >>= 1;
  20. }
  21. return x;
  22. }
  23.  
  24.  
  25. //_ ***************************** START Below *******************************
  26.  
  27.  
  28.  
  29.  
  30. vector<pair<int,int>> a;
  31.  
  32. int consistency(int n){
  33.  
  34. vector<int> dif(n);
  35. int sum = 0;
  36. for(int i=0; i<n; i++){
  37. int x = a[i].first;
  38. int y = a[i].second;
  39.  
  40. sum += y*n-x;
  41. dif[i] = x-y;
  42. }
  43.  
  44. sort(begin(dif), end(dif), greater<int>());
  45.  
  46. for(int i=0; i<n; i++){
  47. sum += dif[i]*(i+1);
  48. }
  49.  
  50.  
  51. return sum;
  52. }
  53.  
  54.  
  55.  
  56.  
  57.  
  58.  
  59.  
  60.  
  61.  
  62.  
  63.  
  64.  
  65.  
  66.  
  67.  
  68. int practice(int n){
  69.  
  70.  
  71. return 0;
  72. }
  73.  
  74.  
  75.  
  76.  
  77.  
  78. void solve() {
  79.  
  80. int n;
  81. cin>> n;
  82.  
  83. for(int i=0; i<n; i++){
  84. int x, y;
  85. cin >> x >> y;
  86. a.push_back({x,y});
  87. }
  88.  
  89. cout << consistency(n) << endl;
  90.  
  91.  
  92. }
  93.  
  94.  
  95.  
  96.  
  97.  
  98. int32_t main() {
  99. ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  100.  
  101. int t = 1;
  102. // cin >> t;
  103. while (t--) {
  104. solve();
  105. }
  106.  
  107. return 0;
  108. }
Success #stdin #stdout 0s 5288KB
stdin
10
5 10
12 4
31 45
20 55
30 17
29 30
41 32
7 1
5 5
3 15
stdout
1423