fork download
copy 
  1. #include<bits/stdc++.h>
  2. using namespace std;
  3. #define endl '\n'
  4. #define int long long
  5. const int MOD = 158400;
  6. const int MOD2 = 998244353;
  7. const int INF = LLONG_MAX/2;
  8.  
  9. int primes[1000000];
  10.  
  11. void seive(){
  12.     fill(primes, primes + 1000000, 1);
  13.     primes[0] = primes[1] = 0;
  14.     for(int i = 2 ; i*i < 1000000 ; i++){
  15.         if(primes[i]){
  16.             for(int j = i*i ; j < 1000000 ; j += i){
  17.                 primes[j] = 0;
  18.             }
  19.         }
  20.     }
  21.     for(int i = 1 ; i < 1000000 ; i++){
  22.         primes[i] += primes[i-1];
  23.     }
  24. }
  25. int factorial(int n){
  26.     if(n==0){
  27.         return 1;
  28.     }
  29.     return (n*(factorial(n-1)))%MOD;
  30. }
  31. bool isPrime(int n){
  32.     if(n <= 1) return false;
  33.     for(int i = 2 ; i*i <= n ; i++){
  34.         if(n % i == 0) return false;
  35.     }
  36.     return true;
  37. }
  38.  
  39. int power(int a, int b){
  40.     if(b == 0) return 1;
  41.     a %= MOD;
  42.     int value = power(a, b / 2);
  43.     if(b % 2 == 0){
  44.         return (value * value) % MOD;
  45.     } else {
  46.         return ((value * value) % MOD * (a % MOD)) % MOD;
  47.     }
  48. }
  49.  
  50. int gcd(int a, int b){
  51.     if(a == 0) return b;
  52.     return gcd(b % a, a);
  53. }
  54. void solve() {
  55.     int n,q;
  56.     cin>>n>>q;
  57.     int A[n];
  58.     for(int i = 0 ; i<n ; i++){
  59.         cin>>A[i];
  60.     }
  61.     sort(A,A+n);
  62.     int prefix[n];
  63.     prefix[0] = A[0];
  64.     for(int i = 1 ; i<n ; i++){
  65.         prefix[i] = prefix[i-1]+A[i];
  66.     }
  67.     for(int i = 0 ; i<q ; i++){
  68.         int query;
  69.         cin>>query;
  70.         int sum = 0;
  71.         auto it = lower_bound(A,A+n,query);
  72.         if(it!=(A+n)){
  73.            int index = it-A;
  74.            if(index>0){
  75.               sum += (query*index)-(prefix[index-1]);
  76.               sum += (prefix[n-1]-prefix[index-1])-(query*(n-index));
  77.            }
  78.            else{
  79.               sum += (prefix[n-1])-(query*n);
  80.            }
  81.         }
  82.         else{
  83.             sum += (query*n)-prefix[n-1];
  84.         }
  85.         cout<<sum<<endl;
  86.     }
  87. }
  88.  
  89. signed main(){
  90.     ios::sync_with_stdio(false); cin.tie(NULL);
  91.     //int t;
  92.     //cin >> t;
  93.     //while(t--){
  94.         solve();
  95.     //}
  96.     return 0;
  97. }
  98.  
  99.  
Success #stdin #stdout 0.01s 5288KB
comments (?)
stdin
copy 
3 3
2 5 1
8 4 3
stdout
copy 
16
6
5
https://ideone.com/ISOUhT
language:
C++14 (gcc 8.3)
created:
1 day ago
visibility:
public

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!