Submission #1188154

#TimeUsernameProblemLanguageResultExecution timeMemory
1188154yhx3Advertisement 2 (JOI23_ho_t2)C++20
10 / 100
224 ms21660 KiB
#include <iostream>
#include <bits/stdc++.h>
#include <iomanip>
#include <numeric>
 
using namespace std;
 
#define ll long long
 
bool comp(const pair<ll,ll> &a,pair<ll,ll> &vl)
{
    return a.second > vl.first;
}
 
bool scomp(const pair<ll,ll> &a,pair<ll,ll> &vl)
{
    return a.first >= vl.first;
}
 

void solve() {
    int n;
    cin >> n;
    set<int> st;
    for (int i = 0; i < n; i++)
    {
        int x,E;
        cin >> x >> E;
        st.insert(x);
    }
    cout << st.size() << endl;
    
}

int main() {
    ios_base::sync_with_stdio(false);
    int t = 1;
    // cin>>t;

    while(t--) {
        solve();
    }
    return 0;

}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...