Submission #1283871

#	Time	Username	Problem	Language	Result	Execution time	Memory
1283871		Faisal_Saqib	Exhibition (JOI19_ho_t2)	C++20	100 / 100	38 ms	2016 KiB

joi2019_ho_t2

/* 
    VENI VIDI VICI
*/

// #pragma GCC optimize("Ofast","unroll-all-loops","fast-math","no-stack-protector","give-no-fuck")
#include <bits/stdc++.h>
// #include <iostream>
// #include <vector>
// #include <algorithm>
// #include <set>
// #include <map>

using namespace std;
#define fi first
#define se second
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()

#define rep(i,x, n) for (int i = (x); i < (n); ++i)
#define repr(i,x, n) for (int i = (n) - 1; i >= (x); --i)
mt19937 RNG(chrono::steady_clock::now().time_since_epoch().count());  
// #define sum accumulate

//using i128 = __int128;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using str = string;
using pi = pair<int, int>;
using pl = pair<ll, ll>;

using vi = vector<int>;
using vl = vector<ll>;
using vpi = vector<pair<int, int>>;
using vvi = vector<vi>;
using sll = set<ll>;

// template<class T>
// istream& operator>>(istream& is, vector<T>& v) {
//     for(auto &i:v) is>>i;
//     return is;
// }
// template<class T1,class T2>
// istream& operator>>(istream& is, pair<T1,T2>& p) {
//     is>>p.fi>>p.se;
//     return is;
// }
// template<class T>
// ostream& operator<<(ostream& os, const vector<T>& v) {
//     for(const auto &i:v) os<<i<<' ';
//     return os;
// }
// template<class T1,class T2>
// ostream& operator<<(ostream& os, const pair<T1,T2>& p) {
//     os<<p.fi<<' '<<p.se; return os;
// }
void pyn(bool x)
{
    cout<<(x?"YES":"NO")<<endl;
}
void pYN(bool x)
{
    cout<<(x?"Yes":"No")<<endl;
}
void pAB(bool x)
{
    cout<<(x?"Alice":"Bob")<<endl;
}
ll powmod(ll a,ll b,ll modulo)
{
  if(b==0){
    return 1;
  }
  ll temp=powmod(a,b/2,modulo);
  if(b%2==0){
    return (temp*temp)%modulo;
  }
  else{
    return (a*((temp*temp)%modulo))%modulo;
  }
}
bool Prime(ll n){
    for (ll i = 2; i*i <= n; i++)
        if (n % i == 0)
            return false;
    return (n>1);
}
void readIO() {
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
}

void solve();

int main() {
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    // readIO();

    int uwu=1;

    // cin>>uwu;

    for(int tc=1;tc<=uwu;tc++) {
        // cout<<"Case #"<<tc<<": ";
        solve();
    }
    return 0;
}

void solve()
{
    ll n ,m;
    cin>>n>>m;
    vpi a(n);
    for(int i=0;i<n;i++)
    {
      cin>>a[i].se>>a[i].fi;
    }
    // cin>>a;
    // for(auto&i:a)swap(i.fi,i.se);
    vl c(m);
    for(int j=0;j<m;j++)cin>>c[j];
    // cin>>c;
    sort(all(a));
    sort(all(c));
    int ans=0;
    for(int i=n-1;i>=0 and ans<m;i--)
    {
        if(a[i].se<=c[m-ans-1])
        {
            ans++;
        }
    }
    cout<<ans<<endl;
}

Compilation message (stderr)

joi2019_ho_t2.cpp: In function 'void readIO()':
joi2019_ho_t2.cpp:90:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   90 |     freopen("input.txt", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
joi2019_ho_t2.cpp:91:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   91 |     freopen("output.txt", "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 10 / 10
• Subtask 2: 40 / 40
• Subtask 3: 50 / 50