1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
#include<bits/stdc++.h>
using namespace std;
const int maxn=111;
int price[maxn],val[maxn];
int Q,n;
int main()
{
    double x;
    int y;
    cin>>Q;
    while(Q--)
    {
        cin>>n;
        for(int i=1;i<=n;i++)
        {
            scanf("%lf%d",&x,&y);
            price[i]=x*10;
            val[i]=y;   
        }
        int ans=-1;
        for(int i=1;i<=n;i++)
        {
            if(price[i]%50==0)
            ans=max(val[i],ans);
        }
        for(int i=1;i<=n-1;i++)
        {
            for(int j=i+1;j<=n;j++)
            {
                if((price[i]+price[j])%50==0)
                ans=max(ans,val[i]+val[j]);
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX