取一个整数数组中最大和次大的二个数

#include "stdafx.h"
#include <string>
#include <vector>
#include <cstdlib>
#include <math.h>
#include <algorithm>
#include <iostream>
#include<time.h>
using namespace std;
#define MAX 10000
int sttoi(string s)
{
    int res = 0;
    int l = s.size();
    if (s[0] != '-')//考虑负数
    {       
        for (int i = l - 1; i >= 0; i--)
        {
            int t = s[i] - '0';
            res += t*pow(10, i);
        }
    }
    else
    {
        for (int i = l - 1; i >0; i--)
        {
            int t = s[i] - '0';
            res += t*pow(10, i-1);
        }
        res = res*(-1);
    }
    return res;
}
void sort(int * A,int l)
{
    for (int i = 0; i < l; i++)
    {
        for (int j = i+1; j < l; j++)
        {
            if (A[i]<A[j])
            {
                int t = A[i];
                A[i] = A[j];
                A[j] = t;
            }
        }
    }
}
int main()
{
    string a;
    int A[MAX];
    getline(cin,a);
    if (a.length() == 0)
    {
        cout << 0 << "," << 0;
        return 0;
    }
    int loc = a.find(",");
    if (loc == -1)
    {
        cout << a << "," << a;
        return 0;
    }
    int cnt = 0;
    while (loc != -1)
    {
        A[cnt++] = sttoi(a.substr(0, loc));
        string t = a.substr(loc + 1);
        a = t;
        loc = a.find(",");
    }
    A[cnt++] = sttoi(a);
    sort(A, cnt);
    cout << A[0] << "," << A[1];
    return 0;
}