fork download 
  1. /*
  2.     AUTHOR:         abc_coders
  3.     INSTITUITION:   BITS PILANI, PILANI
  4. */
  5. #include <iostream>
  6. #include <cstdio>
  7. #include <iomanip>
  8. #include <iterator>
  9. #include <cmath>
  10. #include <cassert>
  11. #include <cstring>
  12. #include <algorithm>
  13. #include <vector>
  14. #include <map>
  15. #include <set>
  16. #include <list>
  17. #include <queue>
  18. #include <climits>
  19.  
  20. using namespace std;
  21.  
  22. #define fastio          std::ios_base::sync_with_stdio(false)
  23. #define inchar          getchar_unlocked
  24. #define PAUSE_EXE       assert(false)
  25. #define LL              long long
  26. #define MAX             100005
  27. #define MOD             1000000007
  28. #define REP(i,n)        for(__typeof(n) i=0; i<n; ++i)
  29. #define REP1(i,n)       for(__typeof(n) i=1; i<=n; ++i)
  30. #define REP2(i,n)       for(__typeof(n) i=1; i<n; ++i)
  31. #define CREP(i,n)       for(__typeof(n) i=n-1; i>=0; --i)
  32. #define CREP1(i,n)      for(__typeof(n) i=n; i>=1; --i)
  33. #define CREP2(i,n)      for(__typeof(n) i=n-1; i>=1; --i)
  34. #define MYREP(i,a,b)    for(__typeof(a) i=a; i<=b; ++i)
  35. #define MYCREP(i,a,b)   for(__typeof(a) i=b; i>=a; --i)
  36. #define SET(a, b)       memset(a, b, sizeof(a))
  37. #define sz(a)           int((a).size())
  38. #define pb              push_back
  39. #define fi              first
  40. #define sec             second
  41. #define all(c)          (c).begin(),(c).end()
  42. #define allr(c)         (c).rbegin(),(c).rend()
  43. #define reset(c)        (c).clear()
  44. #define loop(c,i)       for(typeof(c.begin()) i = c.begin(); i != c.end(); i++)
  45. #define present(c,x)    ((c).find(x) != (c).end())
  46. #define cpresent(c,x)   (find(all(c),x) != (c).end())
  47.  
  48. const double EPS = 1e-10;
  49.  
  50. template <typename T> T max(T &a, T &b) {return (!(a < b) ? a : b);}
  51. template <typename T> T min(T &a, T &b) {return (a < b ? a : b);}
  52. template <typename T> T mod(T a, T b) {return (a < b ? a : a % b);}
  53. LL mulmod(LL a,LL b, LL m){LL q=(LL)(((long double)a*(long double)b)/(long double)m);LL r=a*b-q*m;if(r>m)r%=m;if(r<0)r+=m;return r;}
  54. template <typename T>T power(T e, T n, T m){T x=1,p=e;while(n){if(n&1)x=mod(x*p, m);p=mod(p*p, m);n>>=1;}return x;}
  55. template <typename T> T InverseEuler(T a, T m){return (a==1? 1 : power(a, m-2, m));}
  56. template <typename T> T gcd(T a, T b){return (!b)? a:gcd(b,a%b);}
  57. template <typename T> T lcm(T a, T b){return (a*(b/gcd(a,b)));}
  58.  
  59. LL a[MAX], sum[MAX];
  60.  
  61. int main()
  62. {
  63.     int n, num;
  64.     scanf("%d", &n);
  65.     REP1(i, n)
  66.         scanf("%d", &a[i]);
  67.     sort(a, a+n+1);
  68.     sum[0] = 0;
  69.     REP1(i, n)
  70.         sum[i] = sum[i-1] + a[i];
  71.     int k;
  72.     scanf("%d", &k);
  73.     while (k--)
  74.     {
  75.         scanf("%d", &num);
  76.         int pos = ceil((double)n/(double)(num+1));
  77.         LL ans;
  78.         ans = sum[pos];
  79.         printf("%lld\n", ans);
  80.     }
  81.     return 0;
  82. }
Success #stdin #stdout 0s 5028KB
comments (?)
stdin 
4
3 2 1 4
2
0
2
stdout 
10
3
https://ideone.com/sIPh8C
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!