Submission #932827

# Submission time Handle Problem Language Result Execution time Memory
932827 2024-02-24T09:47:00 Z ishat_jha Best Place (NOI17_bestplace) C++14
23 / 100
91 ms 2016 KB
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ff first
#define ss second

void solvr()
{
	ll n;
	cin >> n;
	vector<pair<ll, ll>> v(n);
	for(ll i = 0; i < n; i++)
	{
		cin >> v[i].ff >> v[i].ss;
	}
	if(n == 2)
	{
		cout << v[0].ff << " " << v[0].ss << endl;
		return;
	}
	ll tt = 0;
	ll minn = LLONG_MAX;
	for(ll i = 0; i < 1000; i++)
	{
		ll sum = 0;
		for(ll j = 0; j < n; j++)
		{
			sum += abs(v[j].ff - i);
		}
		if(minn > sum)
		{
			tt = i;
			minn = sum;
		}
	}
	cout << tt << " " << 0 << endl;
}

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
	long long int t = 1;
	//cin >> t;
	while(t--)
	{
		solvr();
	}
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Incorrect 85 ms 1884 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 91 ms 2016 KB Output isn't correct
2 Halted 0 ms 0 KB -