C++ vector 结构体排序

LintCode sort函数用不好 sort(A.begin(),B.end(),less());

结构体用法

class Solution {
public:
    /**
     * @param A: an integer array
     * @param target: An integer
     * @param k: An integer
     * @return: an integer array
     */
    struct data{
         int a;
         int target;
         bool operator <(const data&y)const{
             if(abs(a-target)!=abs(y.a-y.target)) return abs(a-target) kClosestNumbers(vector &A, int target, int k) {
        // write your code here
        vector vdata;
        for(int i=0;i ans;
        for(int i=0;i