For this Question: Given an array (Arr) of N integers. You have to select a subsequence from this array such that its score is best possible. Score of a sequence is equal to 0 if the sum of the elements of the sequence is divisible by 10 otherwise the score is the sum of the elements of the sequence.
For example: the score of sequence 11, 2, 2, 1 is 16, and the score of sequence 1, 9 is 0.
You have to print the maximum possible score.The first line of input contains N. 
The second line of input contains N space-separated integers representing the array (Arr).

<b>Constraints :</b> 
1 &le; N &le;100000
1&le; Arr[i] &le; 100000Print the maximum possible score.  Sample Input 1
3
5 10 15

Sample output 1
25

<b>Explanation:</b>
 we select 10, and 15 as our sequence., I have written this Solution Code: #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define VV vector
#define pb push_back
#define bitc  __builtin_popcountll
#define m_p make_pair
#define infi 1e18+1
#define eps 0.000000000001
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);
string char_to_str(char c){string tem(1,c);return tem;}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template<class T>//usage rand<long long>()
T rand() {
    return uniform_int_distribution<T>()(rng);
}
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
 
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> oset;
// string to integer stoi()
// string to long long stoll()
// string.substr(position,length);
// integer to string to_string();
 
//////////////
auto clk=clock();
#define all(x) x.begin(),x.end()
#define S second
#define F first
#define sz(x) ((long long)x.size())
#define int long long  
#define f80 __float128
#define pii pair<int,int>
/////////////
signed main()
{
	fastio;
	#ifdef ANIKET_GOYAL
		freopen("inputf.in","r",stdin);
		freopen("outputf.in","w",stdout);
	#endif
	int n;
	cin>>n;
	int mi=0;
	int ans=0;
	for(int i=1;i<=n;++i)
	{
		int d;
		cin>>d;
		ans+=d;
		if(d%10!=0)
		{
			if(mi==0)
				mi=d;
			mi=min(mi,d);
		}
	}
	if(ans%10==0)
		ans-=mi;
	if(ans%10==0)
	{
		cout<<"0";
	}
	else
	{
		cout<<ans;
	}
	#ifdef ANIKET_GOYAL
		// cout<<endl<<endl<<endl<<endl<<"Time elapsed: "<<(double)(clock()-clk)/CLOCKS_PER_SEC<<endl;
	#endif
}, In this Programming Language: C++, Now tell me if this Code is compilable or not?