C++ :

#include <bits/stdc++.h>
using namespace std;

int main(){
	int a[10000],x,g,s,b,q,i,r = 0,c = 0,n;
	int t[10000],k = 0;
	cin>>x>>n;
	for(i = 0;i < n;i++){
		cin>>a[i];
		g = a[i] % 10;
		s = a[i] / 10 % 10;
		b = a[i] / 100 % 10;
		q = a[i] / 1000;
		
		if(g + s + b + q == x){
			t[k] = a[i];
			r = r + t[k];
			k++;
		}
	}
	
	sort(t,t+k);
	cout<<r<<" "<<k<<endl;
	for(i = 0;i < k;i++){
		cout<<t[i]<<" ";
	}
}

Java :

import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int x = sc.nextInt();
		int n = sc.nextInt();
		int[] a = new int[n];
		for(int i =0;i<n;i++){
			a[i] = sc.nextInt();
		}
          getSum(a,x);
	}
	public static void getSum(int[] a,int x){
		int t ;int sum = 0;int k = 0;
		for(int i = 1;i<a.length;i++){
			for(int j = 0;j<a.length-i;j++){
				if(a[j]>a[j+1]){
					t = a[j];
					a[j] = a[j+1];
					a[j+1] = t;
				}
			}
			
		}
		for(int i = 0;i<a.length;i++){
			int b = a[i] % 10;
			int c = a[i] / 10 % 10;
			int d = a[i]/100 %10;
		    int e = a[i]/1000;
		    if(b+c+d+e==x){
		    	sum = sum + a[i];
		    	k ++ ;	
		    }
		}
		System.out.println(sum+" " + k);
		for(int i = 0;i<a.length;i++){
			int b = a[i] % 10;
			int c = a[i] / 10 % 10;
			int d = a[i]/100 %10;
		    int e = a[i]/1000;
		    if(b+c+d+e==x){
		    	System.out.print(a[i] +" ");
		    }
		}
	}

}

Python :

def swh(n):
    s=list(map(int,str(n)))
    return sum(s);
m,n=list(map(int,input().split()))
s1=list(map(int,input().split()))

s2=[item for item in s1 if swh(item)==m]
print(sum(s2),len(s2))
s2.sort()
for item in s2:
    print(item,end=" ")