fork download
copy 
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define ll long long
  4. #define fi first
  5. #define se second
  6. #define MOD 1000000007
  7. #define FOR(i,a,b) for (int i = (a);i <= (b);i++)
  8. #define FOD(i,a,b) for (int i = (b);i >= (a);i--)
  9. #define ALL(x) (x).begin(),(x).end()
  10. #define ii pair<int,int>
  11. #define iii pair<int,pair<int,int>>
  12. //const int MOD = 998244353;
  13. const int MAXN = 1e6+7;
  14. int a[MAXN],sum[MAXN];
  15. int sum_digit(int n){
  16.     int ans = 0;
  17.     while(n>0){
  18.         ans+=n%10;
  19.         n/=10;
  20.     }
  21.     return ans;
  22. }
  23. int main(){
  24.     ios_base::sync_with_stdio(false);
  25.     cin.tie(0); cout.tie(0);
  26.     int n,k;cin >> n >> k;
  27.     FOR(i,1,n)cin >> a[i];
  28.     priority_queue<int> pq;
  29.     FOR(i,1,n)pq.push(a[i]);
  30.     FOR(i,1,MAXN)sum[i] = sum_digit(i);
  31.     sum[0] = 0;
  32.     k = min(k,20000000);
  33.     FOR(i,1,k){
  34.         int x = pq.top();
  35.         pq.pop();
  36.         if (i==k)cout << sum[x];
  37.         pq.push(x-sum[x]);
  38.         if (x==0){
  39.         	if (i!=k)cout << 0;
  40.         	break;
  41.         }
  42.     }
  43.     return (0^0);
  44. }
  45. /*   /\_/\
  46.     (  -.-)
  47.     / >  \>
  48. */
Success #stdin #stdout 0.02s 7948KB
comments (?)
stdin
copy 
5 3
22 15 7 2 1
stdout
copy 
6
https://ideone.com/nR7gRj
language:
C++ (gcc 8.3)
created:
49 days 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!