Submission #226004

#	Time	Username	Problem	Language	Result	Execution time	Memory
226004		Ruxandra985	Exhibition (JOI19_ho_t2)	C++14	100 / 100	102 ms	5368 KiB

joi2019_ho_t2

#include <bits/stdc++.h>
#define DIMN 100010
using namespace std;
int w[DIMN] , f[DIMN];
pair <int , int> p[DIMN] , v[DIMN];
int n , m;

int check (int nr){
    int i , p2;

    /// folosesti cele mai mari nr rame

    p2 = m;

    for (i = n ; i ; i--){
        if (v[i].second <= w[p2])
            p2--;
        if (p2 == m - nr)
            return 1;
    }

    return 0;

}

int main()
{
    FILE *fin = stdin;
    FILE *fout = stdout;
    int i , st , dr , mid;
    fscanf (fin,"%d%d",&n,&m);
    for (i = 1 ; i <= n ; i++){
        fscanf (fin,"%d%d",&v[i].second,&v[i].first);
    }
    for (i = 1 ; i <= m ; i++)
        fscanf (fin,"%d",&w[i]);

    sort (v + 1 , v + n + 1);
    sort (w + 1 , w + m + 1);

    for (i = 1 ; i <= n ; i++)
        p[i] = make_pair(v[i].second , -i);

    sort (p + 1 , p + n + 1);

    st = 1;
    dr = min (n , m);
    while (st <= dr){
        mid = (st + dr) / 2;
        if (check(mid))
            st = mid + 1;
        else dr = mid - 1;
    }

    fprintf (fout,"%d",dr);

    return 0;
}

Compilation message (stderr)

joi2019_ho_t2.cpp: In function 'int main()':
joi2019_ho_t2.cpp:31:12: warning: ignoring return value of 'int fscanf(FILE*, const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     fscanf (fin,"%d%d",&n,&m);
     ~~~~~~~^~~~~~~~~~~~~~~~~~
joi2019_ho_t2.cpp:33:16: warning: ignoring return value of 'int fscanf(FILE*, const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         fscanf (fin,"%d%d",&v[i].second,&v[i].first);
         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
joi2019_ho_t2.cpp:36:16: warning: ignoring return value of 'int fscanf(FILE*, const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         fscanf (fin,"%d",&w[i]);
         ~~~~~~~^~~~~~~~~~~~~~~~

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