| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1350851 | mati_gl | A String Problem (EGOI25_stringproblem) | C++20 | 0 ms | 344 KiB |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a;
cin>>a;
int f=0,h=0,b,c;
vector<int> v(a);
for(int i=0;i<a;i++){
cin>>b>>c;
v[i]=b+c;
}
unordered_map<int,int> m;
for(int i = 0; i < a; i++){
m[v[i]]++;
}
for(auto & x : m){
f = max(f, x.second);
}
if(f!=a-1){
cout<<a-f;
}else{
cout<<a;
}
return 0;
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
