Advertisement
Guest User

Untitled

a guest
Nov 24th, 2017
66
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.49 KB | None | 0 0
  1. #include <iostream>
  2. #include <fstream>
  3. #include <algorithm>
  4.  
  5. using namespace std;
  6.  
  7. pair <int , int > p[500000];
  8.  
  9. int main (){
  10. int n;
  11. cin >> n;
  12. for (int i = 0; i < n; i++){
  13. int x, sum = 0;
  14. cin >> x;
  15. int e = x;
  16. while (e != 0){
  17. sum+=e %10;
  18. e/=10;
  19. }
  20. p[i].first= sum;
  21. p[i].second = x;
  22. }
  23. sort(p, p + n);
  24. for (int i = 0; i < n; i++){
  25. cout << p[i].second << " ";
  26. }
  27. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement