Language: C++

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<vector>
#include<map>
#include<string>
#include<utility>
#include<queue>
using namespace std;
struct team{int m;
                   int t;
                   int p;
                   int j;
                   };
int A[100000];
vector<int>G;
int main(){
	int M,T,P,R;
	vector<pair<int,int> > sum;
	cin>>M;
	cin>>T;
	cin>>P;
	cin>>R;
	int ms[R];
    team A[R];
    for(int i=0;i<R;i++){
		scanf("%d%d%d%d",&A[i].m,&A[i].t,&A[i].p,&A[i].j);
	}
	for(int i=1;i<=T;i++){
		sum.push_back(make_pair(0,i));
	}
	for(int i=1;i<=T;i++){
		ms[i]=0;
		for(int k=0;k<R;k++){
			if(A[k].t==i){
				ms[i]+=A[i].m;
				if(A[k].j==0){
					sum[i].first+=1;
				}
			}
		}
	}
	priority_queue<vector<pair<int,int> > > Q;
	for(int i=0;i<T;i++){
		Q.push(sum[i]);
	}
    for(int i=1;i<=T;i++){
    		vector<pair<int,int> >p=Q.top();
    		Q.pop();
    		printf("%d",p.first);
    		vector<pair<int,int> >q=Q.top();
    		Q.pop();
    	if(p.first==q.first){
    		printf("=");
    	}
    	else{
    		printf(" ");
    	}
    }
    printf("?\n");
   }
			
				
			
	

Compiler output:
a.cc: In function 'int main()':
a.cc:46:23: error: no matching function for call to 'std::priority_queue<std::vector<std::pair<int, int> > >::push(__gnu_cxx::__alloc_traits<std::allocator<std::pair<int, int> >, std::pair<int, int> >::value_type&)'
   46 |                 Q.push(sum[i]);
      |                 ~~~~~~^~~~~~~~
In file included from /usr/include/c++/14/queue:66,
                 from a.cc:9:
/usr/include/c++/14/bits/stl_queue.h:736:7: note: candidate: 'void std::priority_queue<_Tp, _Sequence, _Compare>::push(const value_type&) [with _Tp = std::vector<std::pair<int, int> >; _Sequence = std::vector<std::vector<std::pair<int, int> >, std::allocator<std::vector<std::pair<int, int> > > >; _Compare = std::less<std::vector<std::pair<int, int> > >; value_type = std::vector<std::pair<int, int> >]'
  736 |       push(const value_type& __x)
      |       ^~~~
/usr/include/c++/14/bits/stl_queue.h:736:30: note:   no known conversion for argument 1 from '__gnu_cxx::__alloc_traits<std::allocator<std::pair<int, int> >, std::pair<int, int> >::value_type' {aka 'std::pair<int, int>'} to 'const std::priority_queue<std::vector<std::pair<int, int> > >::value_type&' {aka 'const std::vector<std::pair<int, int> >&'}
  736 |       push(const value_type& __x)
      |            ~~~~~~~~~~~~~~~~~~^~~
/usr/include/c++/14/bits/stl_queue.h:744:7: note: candidate: 'void std::priority_queue<_Tp, _Sequence, _Compare>::push(value_type&&) [with _Tp = std::vector<std::pair<int, int> >; _Sequence = std::vector<std::vector<std::pair<int, int> >, std::allocator<std::vector<std::pair<int, int> > > >; _Compare = std::less<std::vector<std::pair<int, int> > >; value_type = std::vector<std::pair<int, int> >]'
  744 |       push(value_type&& __x)
      |       ^~~~
/usr/include/c++/14/bits/stl_queue.h:744:25: note:   no known conversion for argument 1 from '__gnu_cxx::__alloc_traits<std::allocator<std::pair<int, int> >, std::pair<int, int> >::value_type' {aka 'std::pair<int, int>'} to 'std::priority_queue<std::vector<std::pair<int, int> > >::value_type&&' {aka 'std::vector<std::pair<int, int> >&&'}
  744 |       push(value_type&& __x)
      |            ~~~~~~~~~~~~~^~~
a.cc:51:31: error: 'class std::vector<std::pair<int, int> >' has no member named 'first'
   51 |                 printf("%d",p.first);
      |                               ^~~~~
a.cc:54:14: error: 'class std::vector<std::pair<int, int> >' has no member named 'first'
   54 |         if(p.first==q.first){
      |              ^~~~~
a.cc:54:23: error: 'class std::vector<std::pair<int, int> >' has no member named 'first'
   54 |         if(p.first==q.first){
      |                       ^~~~~