#include <bits/stdc++.h>   using namespace std;   const long long INFL = 1LL << 60;   const int INF = 1 << 30;   const long long MOD = 998244353;   double EPS = 1e-10;   vector<long long> dy = {0, 1, 0, -1, 1, 1, -1, -1, 0};   vector<long long> dx = {1, 0, -1, 0, 1, -1, 1, -1, 0};   void pres(double A) { printf( %.12lf n , A); }   void BinarySay(long long x, long long y = 60) {     for (int i = 0; i < (y); i++) cout << (x >> (y - 1 - i) & 1);     cout << endl;   }   long long cnt_bit(long long x) { return __builtin_popcountll(x); }   long long pow_long(long long x, long long k) {     long long res = 1;     while (k > 0) {       if (k % 2) res *= x;       x *= x;       k /= 2;     }     return res;   }   long long pow_mod(long long x, long long k) {     x %= MOD;     long long res = 1;     while (k > 0) {       if (k % 2) {         res *= x;         res %= MOD;       }       x *= x;       x %= MOD;       k /= 2;     }     return res;   }   long long inverse(long long x) { return pow_mod(x, MOD - 2); };   long long gcd(long long a, long long b) {     if (b == 0) return a;     return gcd(b, a % b);   }   long long lcm(long long x, long long y) {     long long res = x / gcd(x, y);     res *= y;     return res;   };   const int MAXcomb = 200010;   long long fac[MAXcomb], finv[MAXcomb], inv[MAXcomb];   void COMinit() {     fac[0] = fac[1] = 1;     finv[0] = finv[1] = 1;     inv[1] = 1;     for (int i = 2; i < MAXcomb; i++) {       fac[i] = fac[i - 1] * i % MOD;       inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;       finv[i] = finv[i - 1] * inv[i] % MOD;     }   }   long long comb(int n, int k) {     if (n < k) return 0;     if (n < 0 || k < 0) return 0;     return fac[n] * finv[k] % MOD * finv[n - k] % MOD;   }   const int MAXkai = 200010;   long long kai_memo[MAXkai];   long long kai(long long N) {     if (kai_memo[N] != 0) return kai_memo[N];     if (N <= 1) return 1;     return kai_memo[N] = N * kai(N - 1) % MOD;   }   long long disit(long long second, long long base = 10) {     long long res = 0;     while (second) {       res++;       second /= base;     }     return res;   }   vector<long long> divisor(long long n) {     vector<long long> res(0);     for (long long i = 1; i * i <= n; i++) {       if (n % i == 0) {         res.push_back(i);         if (i != n / i) res.push_back(n / i);       }     }     sort(res.begin(), res.end());     return res;   }   void solve() {     int n;     cin >> n;     vector<int> a(n);     for (int i = 0; i < (n); i++) cin >> a[i];     sort(a.begin(), a.end());     long long sum = 0;     for (int i = 0; i < (n); i++) sum += a[i];     int m;     cin >> m;     for (int i = 0; i < (m); i++) {       int q;       cin >> q;       cout << sum - a[n - q] << endl;     }   }   int main() {     ios_base::sync_with_stdio(0);     cin.tie(0), cout.tie(0);     solve();   }   