fork download 
  1. #include <iostream>
  2. #include <algorithm>
  3. using namespace std;
  4.  
  5. int digit_decomp(int num, int digits[]) {
  6. 	int i;
  7. 	for (i = 0; num; i++) {
  8. 		digits[i] = num % 10;
  9. 		num /= 10;
  10. 	}
  11. 	return i;
  12. }
  13.  
  14. int main() {
  15. 	int N = 0;
  16. 	int K[3] = { 0 };
  17. 	int N_digits = 0;
  18. 	int num_K = 0;
  19. 	int digits[9] = { 0 };
  20.  
  21. 	cin >> N >> num_K;
  22.  
  23. 	for (int i = 0; i < num_K; i++) {
  24. 		cin >> K[i];
  25. 	}
  26.  
  27. 	sort(K, K + num_K, greater<int>());
  28.  
  29. 	N_digits = digit_decomp(N, digits);
  30.  
  31. 	bool sw = false;
  32. 	for (int i = N_digits - 1; i >= 0; i--) {
  33. 		if ((i == N_digits - 1) && (digits[i] < K[num_K])) {
  34. 			sw = true;
  35. 			continue;
  36. 		}
  37. 		for (int j = 0; j < num_K; j++) {
  38. 			if (sw == true) {
  39. 				digits[i] = K[j];
  40. 				break;
  41. 			}
  42. 			if (digits[i] == K[j]) {
  43. 				break;
  44. 			}
  45. 			if (digits[i] > K[j]) {
  46. 				digits[i] = K[j];
  47.                 sw = true;
  48. 				break;
  49. 			}
  50. 		}
  51. 		cout << digits[i];
  52. 	}
  53.  
  54. 	return 0;
  55. }
Success #stdin #stdout 0.01s 5328KB
comments (?)
stdin 
100000000 1
1
stdout 
100000000
https://ideone.com/QXJu6V
language:
C++ (gcc 8.3)
created:
10 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!