2945. Search Web Pages

#include <bits/stdc++.h>
using namespace std;
typedef struct zz{string s;int t;int k;}zz;
vector <zz> arr(3614);
bool cmp(const zz &a,const zz &b)
{
    if(a.t==b.t)
        return a.k<b.k;
    else
        return a.t>b.t;
}
int main()
{
    int t;
    cin>>t;
    for(int i=0;i<t;i++)
    {
        cin>>arr[i].s>>arr[i].t;
        arr[i].k=i;
    }
    sort(arr.begin(),arr.end(),cmp);
    int i;
    for(i=0;arr[i].t==arr[i+1].t;i++)
    {
        cout<<arr[i].s<<endl;
    }
    cout<<arr[i].s<<endl;
    return 0;
}

webSite Max=Q.top();
while(Q.top().V==Max.V)
{
  webSite tmp=Q.top();Q.pop();
  cout<<tmp.URL<<endl;
}

qsort(crr,T,sizeof(crr[0]),cmp);

for(i=0;i<T;i++){
    if(crr[i].x!=crr[i+1].x)
    break;
}
for(j=0;j<=i;j++){
    printf("%s\n",crr[j].brr);
}
return 0;

#include <bits/stdc++.h>

using namespace std;

int main(){
    int max = - 0x3F3F3F3F;
    int n;
    int cnt = 0;
    string ss[20];
    scanf("%d", &n);
    while (n--!=0){
        string s;
        cin >> s;
        int w;
        cin >> w;
        if (w>max){
               cnt = 0;
            max = w;
            ss[cnt] = s;
            cnt++;
        } else if (w==max){
            ss[cnt] = s;
            cnt++;
        }

    }

    for (int i=0;i<cnt;++i){
        cout << ss[i] << endl;
    }

}

#include<iostream>
#include<string>
using namespace std;
int main(){


    string url[25];
    int v[25];
    int n,max=0;
     std::cin >> n;
    for(int i=0;i<n;i++){
        std::cin>> url[i] >> v[i];
        if(v[i]>max)
            max=v[i];
    }
    for(int i=0;i<n/2;i++){
        if(v[i]==max){
            std::cout << url[i] << std::endl;
        }
    }
    for(int i=n/2;i<n;i++){
        if(v[i]==max){
            std::cout << url[i] << std::endl;
        }
    }

}

#include <iostream>
#include <string>
#include <map>
#include <vector>
using namespace std;

void solve()
{
    int n; cin >> n; cin.ignore();
    map< int, vector<string> > data; int maxValue = 0;
    for (int i = 0; i < n; i++) {
        int value; string url;
        cin >> url >> value;
        if (maxValue < value) {
            maxValue = value;
        }
        if (data.find(value) == data.end()) {
            vector<string> temp;
            temp.push_back(url);
            data[value] = temp;
        } else {
            data[value].push_back(url);
        }
    }
    for (vector<string>::iterator it = data[maxValue].begin(); it != data[maxValue].end(); it++) {
        cout << *it <<endl;
    }
}
int main(int argc, char* argv[])
{
    solve();
    return 0;
}

scanf("%d",&n);
for(i=0; i<n; i++)
    scanf("%s%d",arr[i].URL,&arr[i].vi);

for(i=0; i<n; i++)
    if(arr[i].vi > p[0]->vi)
    { p[0] = &arr[i]; k = j; j = 1;}
    else if(arr[i].vi == p[0]->vi)
    { p[j] = &arr[i]; j++; }

    for(i=0; i<=k; i++)
    printf("%s\n",p[i]->URL);
return 0;