oj.uz

Submission #335846

# Submission time Handle Problem Language Result Execution time Memory
335846 2020-12-14T06:16:22 Z sumit_kk10 Exhibition (JOI19_ho_t2) C++14
0 / 100
 1 ms 492 KB 
#include <bits/stdc++.h>
#define fast ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL)
#define ll long long int
#define ld long double
using namespace std;
const int N = 1e6 + 5;
const int MOD = 1e9 + 7;

void solve(){
    long long int n, m;
    cin >> n >> m;
    pair<long long int, long long int> a[n];
    long long int b[m];
    for(int i = 0; i < n; ++i)
        cin >> a[i].second>> a[i].first;
    sort(a, a + n);
    for(int i = 0; i < m; ++i)
        cin >> b[i];
    sort(b, b + m);
    long long int ans1 = 0;
    bool vis[m + 1];
    memset(vis, 0, sizeof(vis));
    for(int k = 0; k < n; ++k){
        memset(vis, 0, sizeof(vis));
        long long int ans = 0, pre = 0;
        for(int i = k; i < n; ++i){
            int x = a[i].second;
            for(int j = 0; j < m; ++j){
                if(b[j] >= x and vis[j] == 0 and b[j] >= pre){
                    vis[j] = 1;
                    ++ans;
                    pre = b[j];
                    break;
                }
            }
        }
        ans1 = max(ans1, ans);
    }
    cout << ans1;
}

int main(){
    fast;
    int t = 1;
    // cin >> t;
    while(t--)
        solve();
    return 0;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 492 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Incorrect 1 ms 364 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 492 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Incorrect 1 ms 364 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #3
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 492 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Incorrect 1 ms 364 KB Output isn't correct
8 Halted 0 ms 0 KB -