fork download
copy 
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3.  
  4. #pragma region Macros
  5. #define Faster ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
  6. #define ll long long
  7. #define ld long double
  8. #define pii pair<int, int>
  9. #define pll pair<long long, long long>
  10. #define all(x) x.begin(), x.end()
  11. #define rall(x) x.rbegin(), x.rend()
  12. #define pb push_back
  13. #define ff first
  14. #define ss second
  15. #define endl '\n'
  16. #define yes cout << "YES" << endl
  17. #define no cout << "NO" << endl
  18. #define m1 cout << -1 << endl
  19. #pragma endregion
  20.  
  21. #pragma region Math
  22. const ll MOD = 1e9 + 7;
  23. ll gcd(ll a, ll b) { return __gcd(a, b); }
  24. ll lcm(ll a, ll b) { return (a / gcd(a, b)) * b; }
  25. #pragma endregion
  26.  
  27. void solve() {
  28.     int n,m;    cin>>n>>m;
  29.     vector<int>v(m), v1;
  30.  
  31.     for(auto &it:v) cin>>it;
  32.     v1=v;
  33.  
  34.     ll mx=0,mn=0;
  35.     sort(rall(v));
  36.     for(int i=0;i<n;i++){
  37.         mx+=v[0];
  38.         v[0]--;
  39.         sort(rall(v));
  40.     }
  41.     int idx=0;
  42.     sort(all(v1));
  43.     for(int i=0;i<n;i++){
  44.         if(v1[idx]==0)   idx++;
  45.         mn+=v1[idx];
  46.         v1[idx]--;
  47.     }
  48.     cout<<mx<<" "<<mn<<endl;
  49. }
  50.  
  51. int main() {
  52.     Faster;
  53.     int t = 1;
  54.     // cin >> t;
  55.     while (t--) solve();
  56.     return 0;
  57. }
Success #stdin #stdout 0.01s 5324KB
comments (?)
stdin
copy 
10 5
10 3 3 1 2
stdout
copy 
58 26
https://ideone.com/CLfVmN
language:
C++ (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!