text stringlengths 49 983k |
|---|
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
int num[3] = { 0,0,0 };
for (int i = 0; i < N; i++) {
int p;
cin >> p;
num[(p > A) + (p > B)]++;
}
cout << min({ num[0], num[1], num[2] }) << endl;
}
|
#include <cstdio>
#include <algorithm>
int m[3];
int main()
{
int n, a, b;
scanf("%d%d%d", &n, &a, &b);
for (int i = 0; i < n; ++i)
{
int p;
scanf("%d", &p);
if (p <= a) m[0]++;
else if (p <= b) m[1]++;
else m[2]++;
}
printf("%d\n", std::min(m[0], std::min(m[1], m[2])));
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,a,b,x=0,y=0,z=0;
scanf("%d%d%d",&n,&a,&b);
while(n--)
{
int t;
scanf("%d",&t);
if(t<=a) x++;
else if(t<=b) y++;
else z++;
}
printf("%d\n",min(min(x,y),z));
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int N; cin >> N;
int A,B; cin >> A >> B;
int l=0,m=0,n=0;
int p;
for(int i=0; i<N; i++){
cin >> p;
if(p<=A) l++;
else if(p<=B) m++;
else n++;
}
cout << min(l,min(m,n)) << endl;
} |
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
int n,v1,v2,num1,num2,num3;
int main()
{
scanf("%d",&n);
scanf("%d%d",&v1,&v2);
while(n--)
{
int v;
scanf("%d",&v);
if(v<=v1)num1++;
else if(v<=v2)num2++;
else num3++;
}
printf("%d\n",min(num1,min(num2,num3)));
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
int n;
int a,b;
int p[114];
signed main(){
cin>>n>>a>>b;
int x=0,y=0,z=0;
rep(i,n){
cin>>p[i];
if(p[i]<=a)x++;
else if(p[i]<=b)y++;
else z++;
}
cout<<min({x,y,z})<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, a, b, p;
int x, y, z;
int main(){
cin>>n>>a>>b;
for(int i=0; i<n; i++){
cin>>p;
if(p<=a) x++;
else if(p>=b+1) z++;
else y++;
}
cout<<min({x, y, z});
return 0;
} |
#include<iostream>
using namespace std;
int main(){
int n,a,b,p,aa=0,bb=0,cc=0;
cin>>n>>a>>b;
for(int i=0;i<n;++i){
cin>>p;
if(p<=a)
++aa;
else if(p<=b)
++bb;
else
++cc;
}
if(aa<=bb&&aa<=cc)
cout<<aa;
else if(bb<=aa&&bb<=cc)
cout<<bb;
else if(cc<=aa&&cc<=bb)
cout<<cc;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,a,b,p;
cin>>n>>a>>b;
int A=0,B=0,C=0;
for(int i=0;i<n;i++){
cin>>p;
if(p<=a) A++;
else if(p<=b) B++;
else C++;
}
cout<<min(A,min(B,C))<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,a,b;
cin >> n >> a >>b;
int A,B,C;
A=0;
B=0;
C=0;
for(int i=0;i<n;i++){
int m;
cin >>m;
if( m>=b+1){
C++;
}
else if (m>=a+1){
B++;
}
else{
A++;
}
}
cout << min({A,B,C});
} |
#include <iostream>
#include <algorithm>
using namespace std;
int N,A,B,C[3],P;
int main(){
cin>>N>>A>>B;
for(int i=0;i<N;i++){
cin>>P;
if(P<=A){C[0]++;}
else if(P<=B){C[1]++;}
else{C[2]++;}
}
cout<<min(C[0],min(C[1],C[2]))<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int cnt[3];
int main() {
int n, a, b; cin >> n >> a >> b;
for (int i=0;i<n;i++) {
int x; cin >> x;
if (x<=a) cnt[0]++; else if (x<=b) cnt[1]++; else cnt[2]++;
}
cout << min(cnt[0], min(cnt[1], cnt[2])) << endl;
} |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,a,b,A=0,t,B=0,C=0,i;
scanf("%d %d %d",&n,&a,&b);
for(i=1;i<=n;i++)
{
scanf("%d",&t);
if(t<=a)
A++;
else if(t>a&&t<=b)
B++;
else
C++;
}
printf("%d",min(min(A,B),C));
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int n,a,b,cnt1,cnt2,cnt3;
int main()
{
scanf("%d%d%d",&n,&a,&b);
for(int i=1;i<=n;++i)
{
int x;
scanf("%d",&x);
if(x<=a)++cnt1;
else if(x<=b)++cnt2;
else ++cnt3;
}
printf("%d\n",min(cnt1,min(cnt2,cnt3)));
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
int q1,q2,q3;
int main(){
int n,a,b;
cin>>n>>a>>b;
for(int i=0;i<n;i++){
int t;
cin>>t;
if(t<=a) q1++;
else if(t>=b+1) q3++;
else q2++;
}
cout<<min({q1,q2,q3})<<endl;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, x = 0, y = 0, z = 0;
cin >> n >> a >> b;
for (int i = 0; i < n; i++) {
int p;
cin >> p;
if (p > b) x++;
else if (p > a) y++;
else z++;
}
cout << min(min(x, y), z) << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int N,A,B;cin>>N>>A>>B;
int P[N];int a=0,b=0,c=0;
for(int i=0;i<N;i++){
cin>>P[i];
if(P[i]<=A){
a++;
}else if(P[i]<=B){
b++;
}else{
c++;
}
}cout<<min(min(a,b),c)<<endl;
} |
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
int main(void){
int n=0,a,b,p1=0,p2=0,p3=0;
cin>>n>>a>>b;
int P[n];
for(int i=0;i<n;i++)cin>>P[i];
for(int i=0;i<n;i++){
if(P[i]<=a)p1++;
else if(P[i]>b)p3++;
else p2++;
}
cout<<min({p1,p2,p3});
return 0;
} |
#include<iostream>
#include<algorithm>
#include<cmath>
using namespace std;
int main() {
int n,a,b,p,c=0,d=0,f=0;
cin >> n >> a >> b;
for(int i=0; i<n; i++) {
cin >> p;
if(p<=a) {
c++;
}
else if(p>a&&p<=b) {
d++;
}
else {
f++;
}
}
cout << min({c,d,f}) << endl;
} |
#include <iostream>
using namespace std;
int main(){
int n, a, b;
cin >> n >> a >> b;
int q1=0, q2=0, q3=0;
for(int i=0; i<n; ++i){
int p;
cin >> p;
if(p<=a) ++q1;
else if(p<=b) ++q2;
else ++q3;
}
cout << min(q1, min(q2, q3)) << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main(){
int n;
cin >> n;
int a, b;
cin >> a >> b;
int p[n];
int one = 0,two=0,three=0;
for(int i = 0; i < n; i++){
cin >>p[i];
if(p[i]<=a)one++;
else if(p[i]<=b)two++;
else three++;
}
cout << min(one, min(two,three)) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int64_t N, A, B, q;
cin >> N >> A >> B;
int64_t C[3] = {0, 0, 0};
for (int i = 0; i < N; i++)
{
cin >> q;
if (q <= A)
C[0]++;
else if (q >= B + 1)
C[2]++;
else
C[1]++;
}
cout << min(C[0], min(C[1], C[2])) << endl;
} |
#include <bits/stdc++.h>
using namespace std;
int a[1005];
int main(){
int c, b, n, res = 0;
cin >> n >> c >> b;
int A = 0, AB = 0, B = 0;
for(int i = 0; i < n; i++){
cin >> a[i];
if (a[i] <= c) A++;
else if (c + 1 <= a[i] && a[i] <= b) AB++;
else B++;
}
cout << min(A, min(AB, B));
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,a,b,ac=0,abc=0,bc=0;
cin>>n>>a>>b;
for(int i=0;i<n;i++){
int x;
cin>>x;
if(x<=a) ac++;
else if(b<x) bc++;
else abc++;
}
int minnum=min(ac,bc);
minnum=min(minnum,abc);
cout<<minnum<<endl;
} |
#include <bits/stdc++.h>
using namespace std;
int p[110];
signed main()
{
int n,a,b,cnt1=0,cnt2=0,cnt3=0;
cin>>n>>a>>b;
for(int i=1;i<=n;i++){
cin>>p[i];
if(p[i]<=a) cnt1++;
else if(p[i]>b) cnt3++;
else cnt2++;
}
cout<<min(min(cnt1,cnt2),cnt3)<<endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,a,b;
cin>>n>>a>>b;
int c1=0,c2=0,c3=0;
for(int i=0;i<n;i++){
int x;
cin>>x;
if(x<=a)c1++;
else if(x<=b)c2++;
else c3++;
}
int kotae=min({c1,c2,c3});
cout<<kotae<<endl;
return 0;
} |
#include <bits/stdc++.h>
#define rep(i,m,n) for(int i=m;i<n;i++)
#define co(n) cout<<n<<endl
using namespace std;
int main(){
int a=0,b=0,c=0,n,x,y,m;
cin>>n>>x>>y;
rep(i,0,n){
cin>>m;
if(m<=x) a++;
else if(m<=y) b++;
else c++;
}
a=min(a,b);
a=min(a,c);
co(a);
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
int i,j,cnt=0;
int n,a,b;
cin>>n;
cin>>a>>b;
int p[n];
for(i=0;i<n;i++)cin>>p[i];
int p1=0,p2=0,p3=0;
for(i=0;i<n;i++){
if(p[i]<=a)p1++;
else if(a<p[i] && p[i]<=b)p2++;
else p3++;
}
cout<<min(p1,min(p2,p3));
} |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,A,B;
cin >> N >> A >> B;
int P;
int f=0;
int s=0;
int t=0;
for(int i=0;i<N;i++){
cin >> P;
if(P<=A){
f++;
}else if(P>=B+1){
t++;
}else{
s++;
}
}
cout << min({f,s,t}) << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
int c1 = 0, c2 = 0, c3 = 0;
for (int i = 0; i < n; ++i) {
int p;
cin >> p;
if (p <= a) c1++;
else if (p <= b) c2++;
else c3++;
}
cout << min({c1, c2, c3}) << endl;
return 0;
} |
#include<bits/stdc++.h>
#define mx 105
using namespace std;
int n, a, b, p[mx];
int main(){
scanf("%d%d%d", &n, &a, &b);
for(int i = 0; i < n; i++) scanf("%d", &p[i]);
sort(p, p+n);
int t = upper_bound(p, p+n, a) - p;
int u = upper_bound(p, p+n, b) - p;
printf("%d\n", min(min(t, u-t), n-u));
}
|
#include <bits/stdc++.h>
int main()
{
int count[3]{};
int n, a, b;
scanf("%d%d%d", &n, &a, &b);
for (int i{}; i < n; i++)
{
int p;
scanf("%d", &p);
if (p <= a)
count[0]++;
else if (p <= b)
count[1]++;
else
count[2]++;
}
printf("%d\n", *std::min_element(count, count + 3));
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,A,B;
cin>>N>>A>>B;
int a[3];
a[0]=0;
a[1]=0;
a[2]=0;
for(int i=0;i<N;i++){
int p;
cin>>p;
if(p<=A) a[0]++;
else if(p>B) a[2]++;
else a[1]++;
}
int ans=a[0];
ans = min(a[2],min(ans,a[1]));
cout << ans << endl;
} |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,A,B,a=0,b=0,c=0;
cin>>N>>A>>B;
for(int i=0;i<N;i++){
int P;
cin>>P;
if(P<=A)
a++;
else if(P<=B)
b++;
else
c++;
}
cout<<min({a,b,c})<<endl;
} |
#include <bits/stdc++.h>
using namespace std;
int N, A, B, c[3], P;
int main()
{cin >> N >> A >> B; while (cin >> P) ++c[P > B ? 2 : P > A];
cout << *min_element(c, c + 3);} |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N,A,B,p=0,q=0;cin>>N>>A>>B;
vector<int> a(N);
for(int i=0;i<N;i++)cin>>a.at(i);
sort(a.begin(),a.end());
for(int i=0;i<N;i++){
if(a.at(i)<=A)p++;
else if(a.at(i)>B)q++;
}
int ans=min(p,q);
ans=min(ans,N-p-q);
cout<<ans<<endl;
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,a,b;
cin >> n >> a >> b;
vector<int> p(n);
int x=0,y=0,z=0;
for(int i=0;i<n;i++){
cin >> p[i];
if(p[i]<=a){
x++;
}
else if(p[i]>b){
z++;
}
else{
y++;
}
}
cout << min({x,y,z}) << endl;
} |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,a,b;
cin >> n >> a >> b;
int s[n];
int c=0,d=0,e=0;
for(int i=0;i<n;i++)
cin >> s[i];
for(int i=0;i<n;i++){
if(s[i]<a+1)
c++;
else if(s[i]>b)
e++;
else
d++;
}
cout << min(min(c,d),e) << endl;
} |
#include<bits/stdc++.h>
using namespace std;
int n,h,w;
int n1,n2,n3;
int main(){
cin>>n>>h>>w;
for(int i=1;i<=n;i++){
int x;
cin >> x;
if(x<=h) n1++;
else if(x<=w) n2++;
else n3++;
}
cout << min(n1,min(n2,n3)) <<endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int N, A, B;
scanf("%d%d%d", &N, &A, &B);
array<int, 3> p({0, 0, 0});
for(int i = 0, c; i < N; ++i){
scanf("%d", &c);
++p[(c > A) + (c > B)];
}
printf("%d", *min_element(p.begin(), p.end()));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,a,b;
cin >> n >> a >> b;
int cnt1=0,cnt2=0,cnt3=0;
for(int i=0;i<n;i++){
int m;
cin >> m;
if(m<=a)cnt1++;
else if(a<m && m<=b)cnt2++;
else if(b<m)cnt3++;
}
cout << min(cnt1,min(cnt2,cnt3)) << endl;
}
|
#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
int n,a,b,c,s[3]={0},i;
cin>>n;
cin>>a>>b;
for(i=0;i<n;i++)
{
cin>>c;
if(c<=a)
s[0]++;
else
{
if(c<=b)
{
s[1]++;
}
else
{
s[2]++;
}
}
}
sort(s,s+3);
cout<<s[0]<<endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, p, x = 0, y = 0, z = 0;
cin >> n >> a >> b;
for (int i = 0; i < n; i++) {
cin >> p;
if (p <= a) {
x++;
} else if (p <= b) {
y++;
} else {
z++;
}
}
cout << min(min(x, y), z) << '\n';
} |
#include<bits/stdc++.h>
using namespace std;
int A,B,a,b,c,n;
int main()
{
cin>>n>>A>>B;
for(int i=0;i<n;i++)
{
int x;
cin>>x;
if(x<=A)a++;
else if(x>A&&x<=B)b++;
else c++;
}
cout<<min(a,min(b,c));
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
int x = 0, y = 0, z = 0;
for (int i = 0; i < n; i++) {
int p;
cin >> p;
x += (p <= a);
y += (a + 1 <= p && p <= b);
z += (b + 1 <= p);
}
cout << min({x, y, z}) << '\n';
return 0;
} |
#include <iostream>
using namespace std;
int main(void) {
int N, A, B, p;
cin >> N >> A >> B;
int cntA = 0, cntB = 0, cntC = 0;
for (int i = 0; i < N; ++i) {
cin >> p;
if (p <= A) ++cntA;
if (A < p && p <= B) ++cntB;
if (B < p) ++cntC;
}
cout << min(cntA, min(cntB, cntC)) << endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N, A, B;
cin >> N >> A >> B;
int a = 0, b = 0, c = 0;
for(int i=0;i<N;i++) {
int p;
cin >> p;
if(p <= A) {
a++;
}else if(p <= B) {
b++;
}else {
c++;
}
}
cout << min({ a, b, c }) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, p, l=0, m=0, r=0;
cin >> n >> a >> b;
for(int i = 0; i < n; i++) {
cin >> p;
if(p <= a) l++;
else if(a < p and p <= b) m++;
else r++;
}
cout << min({l, m, r}) << "\n";
} |
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
int main(){
int n,a,b;
cin>>n>>a>>b;
int i=0,j=0,k=0;
while(n--){
int p;
cin>>p;
if(p<=a)
i++;
else if(p<=b)
j++;
else
k++;
}
cout<<min(min(i,j),k)<<endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,A,B;
int x=0,y=0,z=0;
cin>>N>>A>>B;
for(int i=0;i<N;i++){
int p;
cin>>p;
if(p<=A)
x++;
else if(p>=B+1)
z++;
else y++;
}
if(x<=y&&x<=z)
cout<<x<<endl;
else if(y<=z)
cout<<y<<endl;
else cout<<z<<endl;
} |
#include<bits/stdc++.h>
using namespace std;
int a,b,c;
int aa,bb,cc;
int n;
int main(){
scanf("%d%d%d",&n,&a,&b);
for(int i=0;i<n;i++){
scanf("%d",&c);
if(c<=a)aa++;
else if(c>a&&c<=b)bb++;
else cc++;
}
printf("%d\n",min(aa,min(bb,cc)));
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int i, N, A, B, tmp, P[3];
int main(void){
cin >> N >> A >> B;
for(i = 0; i < N; i++){
cin >> tmp;
if(tmp <= A) P[0]++;
else if(tmp <= B) P[1]++;
else P[2]++;
}
sort(P, P+3);
cout << P[0] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int i,n,a,b,p[101],c1=0,c2=0,c3=0;
cin>>n>>a>>b;
for(i=0;i<n;i++){
cin>>p[i];
if(p[i]<=a){
c1++;
}else if(p[i]>b){
c3++;
}else{
c2++;
}
}
cout << min({c1,c2,c3}) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
int cnt[3] = {};
for (int i = 0; i < N; i++) {
int P;
cin >> P;
if (P <= A) cnt[0]++;
else if (P <= B) cnt[1]++;
else cnt[2]++;
}
cout << min(min(cnt[0], cnt[1]), cnt[2]) << endl;
} |
#include <bits/stdc++.h>
#include <algorithm>
using namespace std;
int main() {
int n, a ,b , p[3] = {};
cin >> n >> a >> b;
for (int i = 0; i < n; ++i){
int pt;
cin >> pt;
if(pt <= a) p[0]++;
else if(pt > a && pt <= b) p[1]++;
else p[2]++;
}
cout << min(min(p[0], p[1]), p[2]) << endl;
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,a,b;
int small=0,big=0,zhong=0;
scanf("%d %d %d",&n,&a,&b);
for(int i=0;i<n;i++){
int x;
scanf("%d",&x);
if(x<=a)
small++;
else if(x>=(b+1))
big++;
else
zhong++;
}
printf("%d\n",min(zhong,min(small,big)));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,a,b;
cin >> n >> a >> b;
int p;
int res1=0,res2=0,res3=0;
for(int i=0;i<n;i++){
cin >>p;
if(p<=a) res1++;
else if(p<=b) res2++;
else res3++;
}
cout << min(res1,min(res2,res3)) << endl;
} |
#include<bits/stdc++.h>
using namespace std;
int n,a,b;
int p[110];
int l1=0,l2=0,l3=0;
int main()
{
cin>>n>>a>>b;
for(int i=0;i<n;i++)
{
cin>>p[i];
if(p[i]<=a)
l1++;
else if(p[i]>b)
l3++;
else
l2++;
}
cout<<min(min(l1,l2),l3);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,c;
cin >> a >> b >> c;
int d = 0;
int e = 0;
int f = 0;
for(int i = 0;i < a;++i){
int rrr;
cin >> rrr;
if(rrr <= b){d++;}
else if(rrr <= c){e++;}
else{f++;}
}
cout << min(d,min(e,f)) << endl;
} |
#include <iostream>
using namespace std;
int main(void){
int n,a,b,k=0,l=0,m=0;
cin>>n>>a>>b;
for(int i=0;i<n;i++){
int p;
cin>>p;
if(p<=a){
k++;
}else if(p<=b){
l++;
}else{
m++;
}
}
cout<<min(min(l,m),k)<<endl;
}
|
#include<cstdio>
#include<iostream>
using namespace std;
int n,h,w,a,b,x,y,z;
int main()
{
cin>>n>>a>>b;
for(int i=0;i<n;i++)
{
int k;
cin>>k;
if(k<=a) x++;
else if(k>b) z++;
else y++;
}
cout<<min(min(x,y),z);
} |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int sa=0,sb=0,sc=0,a,b,n,i,t;
scanf("%d\n%d %d",&n,&a,&b);
for(i=0;i<n;i++)
{
scanf("%d",&t);
if(t<=a)
sa++;
else if(t>a&&t<=b)
sb++;
else
sc++;
}
printf("%d",min(sa,min(sb,sc)));
return 0;
} |
#include<cstdio>
#include<algorithm>
using namespace std;
int n,a,b,p;
int num1,num2,num3;
int main(){
scanf("%d%d%d",&n,&a,&b);
for(int i=1;i<=n;i++){
scanf("%d",&p);
if(p<=a)num1++;
else if(p>b)num3++;
else num2++;
}
printf("%d",min(num1,min(num2,num3)));
} |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,A,B;
cin >> N >> A >> B;
vector<int> P(N);
int a = 0, b = 0, c = 0;
for (int i = 0; i < N; i++){
cin >> P[i];
if (P[i] <= A){
a++;
} else if (P[i] >= B + 1){
c++;
} else {
b++;
}
}
cout << min(a,min(b,c));
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
int x, y, z;
x = y = z = 0;
for (int i = 0; i < N; i++) {
int p;
cin >> p;
if (p <= A) x++;
else if (p <= B) y++;
else z++;
}
int ans;
ans = min({x, y, z});
cout << ans << '\n';
return 0;
} |
#include <iostream>
#include <vector>
#include <set>
#include <algorithm>
using namespace std;
int main()
{
int N,A,B;
cin>>N>>A>>B;
int a=0,b=0,c=0;
for(int i=0;i<N;i++){
int p;
cin>>p;
if(p<=A) a++;
if(A<p&&p<=B) b++;
if(p>B) c++;
}
cout<< min(a,min(b,c)) <<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
int ap=0;
int atbp=0;
int bp=0;
int main()
{
int n;
int a,b;
scanf("%d %d %d",&n,&a,&b);
for(int i=0;i<n;i++)
{
int t;
scanf("%d",&t);
if(t<=a)
ap++;
else if(t<=b)
atbp++;
else
bp++;
}
printf("%d",min(ap,min(atbp,bp)));
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,a,b,cur,a1=0,a2=0,a3=0;
cin >> n >> a >> b;
for(int i=0; i<n; i++){
cin >> cur;
if(cur<=a){ a1++;}
else if(cur<=b){
a2++;}
else{
a3++;
}
}
cout << min(min(a1,a2),a3) << endl;
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N,a,b;
cin>>N>>a>>b;
int c=0;
int d=0;
int e=0;
for(int i=0;i<N;i++){
int p;
cin>>p;
if(p<=a){
c++;
}
else if(p>a&&p<=b){
d++;
}
else{
e++;
}
}
cout<<min({c,d,e})<<endl;
} |
#include <iostream>
using namespace std;
int main(void){
int n,a,b,p[111];
cin>>n>>a>>b;
int x=0,z=0,y=0;
for(int i=0;i<n;i++){
cin>>p[i];
if(p[i]<=a)x++;
if(a<p[i] && p[i]<=b)y++;
if(b<p[i])z++;
}
cout<<min(min(x,y),z);
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;
int main(){
int n,a,b;cin>>n>>a>>b;
int p[n];
int m[3];
fill(m,m+3,0);
for(int i=0;i<n;i++){
cin>>p[i];
if(p[i]<=a)m[0]++;
else if(p[i]<=b)m[1]++;
else m[2]++;
}
sort(m,m+3);
cout<<m[0]<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,A,B,x,y;cin>>N>>A>>B;
vector<int>P(N);
for(int i=0;i<N;i++)cin>>P.at(i);
sort(P.begin(),P.end());
x=upper_bound(P.begin(),P.end(),A)-P.begin();
y=upper_bound(P.begin(),P.end(),B)-P.begin();
cout<<min({x,y-x,N-y})<<endl;
} |
#include <iostream>
using namespace std;
int main()
{
int n,A,B,x=0,y=0,z=0;
cin>>n>>A>>B;
int a[n];
for(int i=0;i<n;i++){
cin>>a[i];
if(a[i]<=A)
x++;
else if(a[i]>=A+1&&a[i]<=B)
y++;
else
z++;
}
cout<<min(min(x,y),z);
return 0;
} |
#include <iostream>
using namespace std;
int n,x,y;
int a[110];
int t=0,tt=0,ttt=0;
int main()
{
cin >>n>>x>>y;
for (int i=0;i<n;i++)
{
cin >>a[i];
if (a[i]<=x) t++;
else if (a[i]>x && a[i]<=y) tt++;
else ttt++;
}
cout <<min(t,min(tt,ttt));
return 0;
} |
#include<stdio.h>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
int n, a, b;
scanf("%d%d%d", &n, &a, &b);
int x = 0, y = 0, z = 0;
for (int i = 0; i < n; i++)
{
int t;
scanf("%d", &t);
if (t <= a)x++;
else if (t <= b)y++;
else z++;
}
printf("%d\n", min(x, min(y, z)));
} |
#include<iostream>
#include<cstdio>
using namespace std;
int n,a,b,p,x,y,z;
int main(){
scanf("%d%d%d",&n,&a,&b);
for(int i=1;i<=n;++i){
scanf("%d",&p);
if(p<=a)++x;else if(p>a&&p<=b)++y;else ++z;
}
printf("%d",min(x,min(y,z)));
} |
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
int N, A, B;
cin >> N >> A >> B;
int c[] = {0,0,0};
for(int i = 0; i < N; ++i){
int p;
cin >> p;
if(p <= A) ++c[0];
else if(p <= B) ++c[1];
else ++c[2];
}
cout << min(c[0],min(c[1],c[2])) << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
int n,a,b,p,problemone,problemtwo,problemthree;
int main(){
cin>>n>>a>>b;
for(int i = 1;i <= n;i++){
cin>>p;
if(p <= a){
problemone++;
}else if(p <= b){
problemtwo++;
}else{
problemthree++;
}
}
cout<<min(min(problemone,problemtwo),problemthree)<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int N, A, B;
array<int, 3> p({0, 0, 0});
scanf("%d%d%d", &N, &A, &B);
for(int i = 0, c; i < N; ++i){
scanf("%d", &c);
++p[(c > A) + (c > B)];
}
printf("%d", *min_element(p.begin(), p.end()));
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main(void){
int N, A, B; cin >> N >> A >> B;
int low, med, high; low = med = high = 0;
for(int i = 0; i < N; i++){
int v; cin >> v;
if(v <= A) low++;
else if(A+1 <= v && v <= B) med++;
else high++;
}
cout << min(low, min(med, high)) << endl;
}
|
#include <bits/stdc++.h>
#define r(i,n) for(int i = 0; i<n; i++)
typedef long long ll;
using namespace std;
int main(){
int n,a,b,c,d=0,e=0,f=0;
cin >> n >> a >> b;
r(i,n){
cin >> c;
if(c<=a)d++;
else if(a<c&&c<=b)e++;
else f++;
}
cout << min(d,min(e,f))<<endl;
} |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
signed main() {
int n, a, b, c=0, d=0, e=0;
cin >> n >> a >> b;
for (int i = 0; i < n; i++) {
int p; cin >> p;
if (p <= a)c++;
else if (p <= b)d++;
else e++;
}
cout << min(c, min(d, e)) << endl;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
vector<int> a(3);
for (int i = 0; i < N; ++ i) {
int x;
cin >> x;
if (x <= A) ++ a[0];
else if (x <= B) ++ a[1];
else ++ a[2];
}
cout << min(min(a[0],a[1]),a[2]) << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int l = 0;
int m = 0;
int h = 0;
int n;
cin >> n;
int a,b;
cin >> a >> b;
for(int i=0; i<n; i++){
int x;
cin >> x;
if(x > b) ++h;
else if(x > a) ++m;
else ++l;
}
cout << min(l, min(m,h)) << endl;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,A,B;
cin >>N >> A >> B;
int a=0;
int b=0;
int c=0;
for(int i=0;i<N;i++){
int p;
cin >> p ;
if (p<=A){
a++;
}
else if (p<=B){
b++;
}
else {
c++;
}
}
cout << min(a,min(b,c))<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
int32_t main(){
int n , a , b;
cin>>n>>a>>b;
int ra = 0 , rb = 0 , rc = 0;
for(int i = 0 ; i < n; i ++){
int x;
cin>>x;
if(x <= a) ra ++;
else if(x > a && x <= b) rb++;
else rc++;
}
cout<< min(ra , min(rb,rc))<<endl;
} |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,a,b;
cin >> n >> a >> b;
int aa=0,bb=0,cc=0;
for(int i=0;i<n;i++){
int p;
cin >> p;
if(p<=a) aa++;
else if(p>=b+1) bb++;
else cc++;
}
cout << min({aa,bb,cc}) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int N, A, B, i, P;
int num[3] = {0, 0, 0};
cin >> N >> A >> B;
for(i = 0; i < N; i++){
cin >> P;
if(P <= A){
num[0]++;
}
else if(P <= B){
num[1]++;
}
else{
num[2]++;
}
}
cout << min(num[0], min(num[1], num[2])) << endl;
return 0;
} |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, A, B, P, a = 0, b = 0, c = 0;
cin >> N >> A >> B;
for (int i = 0; i < N; ++i) {
cin >> P;
if (A >= P) ++a;
else if (B >= P) ++b;
else ++c;
}
cout << min({ a, b, c });
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
int p, x1 = 0, x2 = 0, x3 = 0;
for (int i = 0; i < N; i++) {
cin >> p;
if (p <= A) x1++;
else if (p <= B) x2++;
else x3++;
}
cout << min({x1, x2, x3}) << endl;
} |
#include <iostream>
using namespace std;
int main() {
int N, A, B; cin >> N >> A >> B;
int P, Q[3];
for(int i=0; i<3; ++i) Q[i]=0;
for(int i=0; i<N; ++i){
cin >> P;
if(P<=A) ++Q[0];
else if(P>B) ++Q[2];
else ++Q[1];
}
cout << min(Q[0], min(Q[1], Q[2])) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,A,B;
cin >> N >> A >> B;
vector<int> P(110);
for(int i=0;i<N;i++){cin >> P[i];}
int a=0; int b=0; int c=0;
for(int i=0;i<N;i++){
if(P[i]<=A){a++;}
else if(P[i]>=B+1){c++;}
else{b++;}
}
cout << min({a,b,c}) << endl;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,a,b;
scanf("%d %d %d ",&n,&a,&b);
int c[3];
memset(c,0,sizeof(c));
while(n--) {
int t;
scanf("%d ",&t);
if(t <= a) {c[0]++;} else if(t <= b) {c[1]++;} else {c[2]++;}
}
printf("%d\n",min(min(c[0],c[1]),c[2]));
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
int main()
{
int n,i,j,k,a,b;
cin>>n>>a>>b;
int p[n];
int ca=0,cb=0,cc=0;
for (i=0;i<n;i++)
{
cin>>p[i];
if (p[i]<=a)
ca++;
else if (p[i]>b)
cc++;
else
cb++;
}
cout<<min(ca,min(cb,cc));
} |
#include <stdio.h>
int n, a, b;
int x, y, z, s;
int main(){
scanf("%d%d%d", &n, &a, &b);
for (int i = 0; i < n; i++) {
scanf("%d", &s);
if (s <= a)x++;
else {
if (s <= b)y++;
else z++;
}
}
if (y < x)x = y;
if (z < x)x = z;
printf("%d\n", x);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a,n,b,p1=0,p2=0,p3=0,t;
cin>>n>>a>>b;
for(int i=1;i<=n;i++){
cin>>t;
if(t<=a)
p1++;
else if(t>a&&t<=b)
p2++;
else
p3++;
}
cout<<min(min(p1,p2),p3);
}
|
#include<iostream>
using namespace std;
int n,a,b,p1,p2,p3;
int main()
{
cin>>n>>a>>b;
for(int i=1;i<=n;i++)
{
int s;
cin>>s;
if(s<=a)
p1++;
else if(s<=b)
p2++;
else
p3++;
}
cout<<min(p1,min(p2,p3));
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int s1,s2,s3;
int n;
int p;
int a,b;
int main(){
cin>>n>>a>>b;
for(int i=1;i<=n;i++){
cin>>p;
if(p<=a) s1++;
else if(p<=b) s2++;
else s3++;
}
cout<<min(s1,min(s2,s3));
return 0;
}
|
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
using namespace std;
int a,b,c;
int n,n1,n2;
int main()
{
scanf("%d%d%d",&n,&n1,&n2);
for(int i=1; i<=n; i++)
{
int x; scanf("%d",&x);
if(x<=n1) {a++;}
else if(x>n2) {c++;}
else {b++;}
}
printf("%d\n",min(min(a,b),c));
return 0;
} |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
using namespace std;
int n, a, b, p, t1, t2, t3;
int main() {
cin >> n >> a >> b;
rep(i, n) {
cin >> p;
if (p <= a) t1++;
else if (p <= b) t2++;
else t3++;
}
cout << min({t1, t2, t3}) << endl;
return 0;
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.