oj.uz

답안 #1040920

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1040920 2024-08-01T12:17:06 Z MrPavlito Exhibition (JOI19_ho_t2) C++17
0 / 100
 1 ms 348 KB 
#include <bits/stdc++.h>
#define int long long
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define sc second
#define endl "\n"
#define pii pair<int,int>

using namespace std;

const int MAXN = 1e5+5;
const int mod7 = 1e9+7;
const long long inf = 1e18;

bool CMP(pii p1, pii p2)
{
    if(p1.sc == p2.sc)return p1.fi < p2.fi;
    return p1.sc < p2.sc;
}

signed main()
{
    ios_base::sync_with_stdio(false),cin.tie(0), cout.tie(0);
    int tt=1;
    //cin >> tt;
    while(tt--)
    {
        int n,m;
        cin >> n >> m;
        vector<pii> slike(n);
        for(int i=0; i<n; i++)cin >> slike[i].fi >> slike[i].sc;
        sort(all(slike), CMP);
        vector<int> ramovi(m);
        for(int i=0; i<m; i++)cin >> ramovi[i];
        sort(all(ramovi));
        int pointer = 0;
        int rez = 0;
        for(int i=0; i<m; i++)
        {
            if(slike[pointer].fi <= ramovi[i])
            {
                rez++;
                pointer++;
            }
        }
        cout << rez << endl;

    }
}

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 0 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 0 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 0 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -