Help me in solving NONPRIME101 problem

help
,
1

My issue

what’s wrong in this

My code

#include <bits/stdc++.h>
using namespace std;
const int m=205;
bool prim[m];
   

void solve(){
    prim[0]=prim[1]=false;
    
    for(int i=2;i<205;i++){
        prim[i]=true;
        for(int j=i*i;j<205;j+=i){
            prim[j]=false;
        }
    }
    
}

int main() {
	// your code goes here
	 ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
	solve();
	int t;
	cin>>t;
	while(t--){
	    int n;
	    cin>>n;
	    vector<pair<int,int>>arr;
	   map<int,int>mp;
	   for(int i=0;i<n;i++){
	       int x;
	       cin>>x;
	      mp[x]++;
	      if(mp[x]<=2){
	          arr.push_back({x,i+1});
	      }
	   }
	   
	   int x=-1,y=-1,c=0;
	   
	   for(int i=0;i<arr.size();i++){
	       for(int j=i+1;j<arr.size();j++){
	           int s=arr[i].first+arr[j].first;
	           if(prim[s]==false){
	               x=arr[i].second;
	               y=arr[j].second;
	               c=1;
	               break;
	           }
	       }
	       if(c==1)break;
	   }
	   
	   
	   if(x!=-1 )cout<<x<<" "<<y<<endl;
	   else cout<<-1<<endl;
	}
	

}

Problem Link: Non-Primes 101 Practice Coding Problem