oj.uz

Submission #320879

# Submission time Handle Problem Language Result Execution time Memory
320879 2020-11-10T06:37:51 Z ishi_10 Best Place (NOI17_bestplace) C++14
100 / 100
 112 ms 3940 KB 
#include<iostream>
#include<cmath>
#include<bits/stdc++.h>
#include<string.h>
using namespace std;
typedef long long int ll;
const ll maxn=1e5+2;
int main()
{
    ll n;
    cin>>n;
    ll a[n],i;
    ll b[n];
    ll sx=0,sy=0;
    for(i=0;i<n;i++)
    {
        cin>>a[i]>>b[i];
    }
    sort(a,a+n);
    sort(b,b+n);
    cout<<a[(((n+1)/ 2) - 1)]<<" "<<b[(((n+1) / 2) - 1)]<<"\n";
    cerr<<"\nTime elapsed:"<< 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
    return 0;
}

Compilation message

bestplace.cpp: In function 'int main()':
bestplace.cpp:14:8: warning: unused variable 'sx' [-Wunused-variable]
   14 |     ll sx=0,sy=0;
      |        ^~
bestplace.cpp:14:13: warning: unused variable 'sy' [-Wunused-variable]
   14 |     ll sx=0,sy=0;
      |             ^~

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 492 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 2 ms 364 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 63 ms 2996 KB Output is correct
2 Correct 70 ms 3048 KB Output is correct
3 Correct 83 ms 3076 KB Output is correct
4 Correct 63 ms 3044 KB Output is correct
5 Correct 68 ms 3044 KB Output is correct
6 Correct 75 ms 3172 KB Output is correct
7 Correct 78 ms 2984 KB Output is correct
8 Correct 69 ms 3044 KB Output is correct

Subtask #4
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct

Subtask #5
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 2 ms 364 KB Output is correct
4 Correct 2 ms 364 KB Output is correct
5 Correct 2 ms 364 KB Output is correct
6 Correct 2 ms 364 KB Output is correct
7 Correct 2 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct

Subtask #6
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 102 ms 3936 KB Output is correct
2 Correct 103 ms 3812 KB Output is correct
3 Correct 87 ms 3808 KB Output is correct
4 Correct 90 ms 3044 KB Output is correct
5 Correct 100 ms 3812 KB Output is correct
6 Correct 98 ms 3812 KB Output is correct
7 Correct 112 ms 3940 KB Output is correct
8 Correct 97 ms 3940 KB Output is correct