Submission #3768758


Source Code Expand

#include <bits/stdc++.h> 

#define INF INT_MAX/2
#define MOD 1000000007

using namespace std;

using ll = long long;
using ull = unsigned long long;

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

   int N;
   cin>>N;
   vector<pair<int,int> > red(N),blue(N);
   for(int i=0;i<N;i++)cin>>red[i].first>>red[i].second;
   for(int i=0;i<N;i++)cin>>blue[i].first>>blue[i].second;


   sort(red.begin(),red.end());
   sort(blue.begin(),blue.end());

   ll ans = 0;
   for(int i=0;i<N;i++){
      for(int j=N-1;j>=0;j--){
         sort(red.begin(),red.end());
         if(blue[i].first > red[j].first){
            red[j].first = INF;
            ans++;
            break;
         }
      }
   }
   cout<<ans<<endl;
   return 0; 
}

Submission Info

Submission Time
Task C - 2D Plane 2N Points
User reg7777
Language C++14 (GCC 5.4.1)
Score 0
Code Size 778 Byte
Status WA
Exec Time 11 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 400
Status
AC × 5
AC × 8
WA × 9
Set Name Test Cases
Sample example_0, example_1, example_2, example_3, example_4
All example_0, example_1, example_2, example_3, example_4, line_0, line_1, line_2, line_3, maxrand_0, maxrand_1, maxrand_2, maxrand_3, maxrand_4, rand_0, rand_1, rand_2
Case Name Status Exec Time Memory
example_0 AC 1 ms 256 KB
example_1 AC 1 ms 256 KB
example_2 AC 1 ms 256 KB
example_3 AC 1 ms 256 KB
example_4 AC 1 ms 256 KB
line_0 AC 2 ms 256 KB
line_1 AC 9 ms 256 KB
line_2 WA 2 ms 256 KB
line_3 AC 1 ms 256 KB
maxrand_0 WA 10 ms 256 KB
maxrand_1 WA 9 ms 256 KB
maxrand_2 WA 11 ms 256 KB
maxrand_3 WA 11 ms 256 KB
maxrand_4 WA 9 ms 256 KB
rand_0 WA 10 ms 256 KB
rand_1 WA 3 ms 256 KB
rand_2 WA 4 ms 256 KB