Please, give me test

#include <iostream>
#include <algorithm>

using namespace std;

int main()
{
    int i,j,k,l,ii;
    int m,n;
    int girls[101];
    int boys[101];
    int count = 0;
    int upsets = 0, girlUpsets = 0, boyUpsets = 0, currentUpsets = 0;
    int happyGirls = 0;
    int chooseGirl = 0, chooseBoy = 0;

    for (i = 0; i <= 100; i ++)
    {
        girls[i] = 0;
        boys[i] = 0;
    }

    cin >> n >> m; //n girls m boys
    for (i = 1; i <= n; i ++)
    {
        cin >> girls[i];
    }
    for (j = 1; j <= m; j ++)
    {
        cin >> boys[j];
    }

    count = min (m, n);
    //计算无配对upset值
    for (i = 1; i <= n; i ++)
        upsets += girls[i];


    happyGirls = 0;


    for (i = 1; i <= count; i ++)

    {
        for (j = 1; j <= n; j ++)
            for ( k = 1; k <= m; k ++)
            {
                girlUpsets = 0;
                boyUpsets = 0;
                //计算girl upset值
                for (l = 1; l <= n; l ++)
                {
                    if (l != j)
                    {
                        girlUpsets += girls[l];
                    }
                }


                //计算boy upset值
                for (l = 1; l <= m; l ++)
                {
                    if (l != k)
                        boyUpsets += boys[l] * (happyGirls + 1);
                    //cout << "werqe: " << boys[l] << '\t' << boyUpsets << endl;
                }


                currentUpsets = girlUpsets + boyUpsets;
                if (currentUpsets < upsets)
                {
                    upsets = currentUpsets;
                    chooseGirl = j;
                    chooseBoy = k;
                }

            }

        if (chooseBoy != 0  && chooseGirl != 0)
        {
            happyGirls ++;

            //删除第chooseGirl个girl
            for (ii = chooseGirl; ii <= n - 1; ii ++)
               girls[ii] = girls[ii + 1];
            n --;

            //删除第chooseBoy个boy
            for (ii = chooseBoy; ii <= m - 1; ii ++)
                boys[ii] = boys[ii + 1];
            m --;
        }

    }
    cout << upsets << endl;
    return 0;
}

I can't find mistake, and have WA on test 7.
Someone can give some cases?

Edited by author 13.11.2011 18:38

I have got error so many times. Wonder wht I am missing..
Here is my Python 3.4 Code

n,m=map(int,input().split())
g=list(map(int,input().split()))
b=list(map(int,input().split()))

g.sort()
b.sort()

minUpset=0


for i in range(0,n):
    minUpset+=g[i]

for s in range(0,min(n,m)):
    girlsUpset=0
    boysUpset=0
    for i in range(0,n-s):
        girlsUpset+=g[i]
    for j in range(0,m-s):
        boysUpset+=b[j]
    minUpset=min(girlsUpset+boysUpset*s,minUpset)

print(minUpset)

//#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC target("avx")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace __gnu_pbds;
using namespace std;

#define re return
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define sqrt(x) sqrt(abs(x))
#define mp make_pair
#define pi (3.14159265358979323846264338327950288419716939937510)
#define fo(i, n) for(int i = 0; i < n; ++i)
#define ro(i, n) for(int i = n - 1; i >= 0; --i)
#define unique(v) v.resize(unique(all(v)) - v.begin())

template <class T> T abs (T x) { re x > 0 ? x : -x; }
template <class T> T sqr (T x) { re x * x; }
template <class T> T gcd (T a, T b) { re a ? gcd (b % a, a) : b; }
template <class T> int sgn (T x) { re x > 0 ? 1 : (x < 0 ? -1 : 0); }

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<string> vs;
typedef double D;
typedef long double ld;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef vector<ll> vll;
typedef unsigned long long ull;
typedef tree <pair<int, char>, null_type, less<pair<int, char>>, rb_tree_tag, tree_order_statistics_node_update> _tree;

const int maxn = 100;
int a[maxn], b[maxn];

int main() {
    int n, m;
    cin >> n >> m;
    fo(i, n) cin >> a[i];
    fo(i, m) cin >> b[i];
    sort(a, a + n), sort(b, b + m);
    reverse(a, a + n), reverse(b, b + m);
    int ans = (int) 1e9, cur;
    fo(k, min(n, m) + 1) {
        cur = 0;
        for (int j = k; j < n; ++j) cur += a[j];
        for (int j = k; j < m; ++j) cur += b[j] * k;
        ans = min (ans, cur);
    }
    cout << ans << endl;
}

Anybody have the code on the C?
I thought about it for a long time and i have no ideas how to do this task.
I would be very grateful if somebody help me with it.

Thanks

I cant find my mistake,but i think my prog is right,it gets Wa on test 4.
Who can give me special cases?

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;

namespace _1788
{
    class Program
    {
        static void Main(string[] args)
        {
            string[] input = Console.ReadLine().Split(' ');
            int n = int.Parse(input[0]);
            int m = int.Parse(input[1]);
            int[] g = new int[n];
            int[] b = new int[m];
            input = Console.ReadLine().Split(' ');
            for (int i = 0; i < n; i++)
            {
                g[i] = int.Parse(input[i]);
            }
            input = Console.ReadLine().Split(' ');
            for (int i = 0; i < m; i++)
            {
                b[i] = int.Parse(input[i]);
            }
            int res = int.MaxValue;
            Array.Sort(g);
            Array.Sort(b);
            int ans = 0;
            if (n>=m)
            {
                for (int i = 0; i < n-m; i++)
                {
                    ans += g[i];
                }
                Console.WriteLine(ans);
                return;
            }

            for (int i = 0; i <= n; i++)
            {
                ans = 0;
                for (int j = 0; j < m-i; j++)
                {
                    ans += b[i] * i;
                }
                for (int q = 0; q < n-i; q++)
                {
                    ans += g[q];
                }
                res = Math.Min(res, ans);
            }
            Console.WriteLine(res);
            Console.ReadLine();
        }
    }
}

Edited by author 15.05.2012 20:33

Thanks

found mistake in sort algo and get AC ^^

Edited by author 30.10.2011 02:12

Edited by author 30.10.2011 02:12

please help me! I got WA 5


#include <iostream>
using namespace std;
int main()
{
    int d,m,sd=0,sm=0,i,k=0,l;
    bool f = true;
    cin>>d>>m;
    int *mass1 = new int[d];
    int *mass2 = new int[m];
    for(i=0;i<d;i++) {cin>>mass1[i]; sd+=mass1[i];}
    for(i=0;i<m;i++) {cin>>mass2[i]; sm+=mass2[i];}
    while(f)
    {
        f=false;
        for(i=0;i<d;i++) {if(mass1[i]<mass1[i+1]) swap(mass1[i],mass1[i+1]), f = false;}
    }
    f = true;
    while(f)
    {
        f=false;
        for(i=0;i<m;i++) {if(mass2[i]<mass2[i+1]) swap(mass2[i],mass2[i+1]), f = false;}
    }
    l=min(d,m);
    int *g = new int[l];
    for(i=0;i<=l;i++)
    {
        if(i!=0) {sm=sm-mass2[i-1],sd=sd-mass1[i-1];}
        g[i]=i*sm+sd;
    }
    for(i=0,k=g[0];i<=l;i++)
    {
        if(g[i]<k) k=g[i];
    }
    cout<<k<<endl;
}

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

bool cmp(int a, int b){
    return a > b;
}

int main(){
    int g, b;
    cin >> g >> b;

    if (g == b) {
        cout << 0 << endl;
        return 0;
    }

    vector<int> girls(g), boys(b);
    for (int i=0;i<g;++i){
        cin >> girls[i];
    }
    for (int i=0;i<b;++i){
        cin >> boys[i];
    }
    sort(girls.begin(), girls.end(), cmp);
    sort(boys.begin(), boys.end(), cmp);

    for (int i=g-2;i>=0;--i){
        girls[i]+=girls[i+1];
    }
    for (int i=b-2;i>=0;--i){
        boys[i]+=boys[i+1];
    }

    vector<int> v(min(g, b));
    for (int i=0;i<min(g, b);++i){
        v[i] = boys[i]*i + girls[i];
    }

    int min = v[0];

    for (int i=1;i<v.size();++i){
        if (min > v[i]) min = v[i];
    }

    cout << min << endl;
    return 0;
}



I don't know which tests fail my code( and why WA1?

how we get 19 in example? don't understand how got odd number.
my answer is 20.

Am nevoie e ajutor, va rog io