oj.uz

Submission #471361

# Submission time Handle Problem Language Result Execution time Memory
471361 2021-09-08T14:52:23 Z grimzzz404 Best Place (NOI17_bestplace) C++17
100 / 100
 50 ms 3032 KB 
/**
 *	 Author: grimzzz404
**/


#include <bits/stdc++.h>
using namespace std;

#define FOR(x) for (int i = 0; i < (x); ++i)
#define FOR_(x,y) for (int i = (x); i < (y); ++i)
#define watch(x) cout << (#x) << " is " << (x) << endl
#define vi vector<int>
#define ll long long
#define ld long double
#define pb push_back
#define ppb pop_back
#define p push
#define pp pop
#define mp make_pair
#define f first
#define s second
#define all(x) (x).begin(), (x).end()
#define sz(x) (x).size
#define endl '\n'

void solve();

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    int t = 1;
    //cin >> t;
    FOR(t)
	{
        //cout << "Test Case #" << i + 1 << '\n';
        solve();
    }
    return 0;
}
void solve()
{
    int n;
    cin >> n;
    int one[n];
    int two[n];
    for (int i = 0; i < n; i++)
    {
        cin >> one[i] >> two[i];
    }
    sort(one,one+n);
    sort(two,two+n);
    int c = n/2;
    cout << one[c] << " " << two[c];

   
}

Subtask #1
3.0 / 3.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 2104 KB Output is correct
2 Correct 30 ms 2252 KB Output is correct
3 Correct 30 ms 2224 KB Output is correct
4 Correct 29 ms 2248 KB Output is correct
5 Correct 28 ms 2228 KB Output is correct
6 Correct 29 ms 2252 KB Output is correct
7 Correct 29 ms 2104 KB Output is correct
8 Correct 30 ms 2232 KB Output is correct

Subtask #4
13.0 / 13.0

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

Subtask #5
17.0 / 17.0

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

Subtask #6
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 2884 KB Output is correct
2 Correct 41 ms 2884 KB Output is correct
3 Correct 30 ms 3032 KB Output is correct
4 Correct 38 ms 2252 KB Output is correct
5 Correct 41 ms 2996 KB Output is correct
6 Correct 41 ms 2992 KB Output is correct
7 Correct 42 ms 3000 KB Output is correct
8 Correct 50 ms 2996 KB Output is correct